./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/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 414bd3100576d7817a22ad1c2dddd24d515cfc8f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 10:16:23,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:16:23,929 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:16:23,935 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:16:23,935 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:16:23,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:16:23,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:16:23,938 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:16:23,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:16:23,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:16:23,939 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:16:23,939 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:16:23,940 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:16:23,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:16:23,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:16:23,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:16:23,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:16:23,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:16:23,943 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:16:23,944 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:16:23,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:16:23,945 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:16:23,946 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:16:23,947 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:16:23,947 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:16:23,947 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:16:23,948 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:16:23,948 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:16:23,948 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:16:23,949 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:16:23,949 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:16:23,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:16:23,950 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:16:23,950 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:16:23,950 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:16:23,950 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:16:23,951 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 10:16:23,958 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:16:23,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:16:23,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:16:23,959 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:16:23,959 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 10:16:23,959 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 10:16:23,959 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 10:16:23,959 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 10:16:23,959 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 10:16:23,959 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 10:16:23,959 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 10:16:23,959 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 10:16:23,959 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 10:16:23,960 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:16:23,960 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:16:23,960 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:16:23,960 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:16:23,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:16:23,960 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:16:23,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:16:23,960 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:16:23,960 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:16:23,960 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:16:23,960 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:16:23,961 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:16:23,961 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:16:23,961 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:16:23,961 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:16:23,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:16:23,961 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:16:23,961 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:16:23,961 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:16:23,961 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 10:16:23,961 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:16:23,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:16:23,962 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 10:16:23,962 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_7313ef5f-f675-4180-b807-9b65484e23cc/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 -> 414bd3100576d7817a22ad1c2dddd24d515cfc8f [2018-12-09 10:16:23,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:16:23,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:16:23,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:16:23,991 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:16:23,991 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:16:23,991 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix022_tso.opt_false-unreach-call.i [2018-12-09 10:16:24,031 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/data/ce3c1925e/bff63829c9404eb292194537c19213b1/FLAGd923ad1bf [2018-12-09 10:16:24,436 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:16:24,436 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/sv-benchmarks/c/pthread-wmm/mix022_tso.opt_false-unreach-call.i [2018-12-09 10:16:24,444 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/data/ce3c1925e/bff63829c9404eb292194537c19213b1/FLAGd923ad1bf [2018-12-09 10:16:24,452 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/data/ce3c1925e/bff63829c9404eb292194537c19213b1 [2018-12-09 10:16:24,454 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:16:24,455 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:16:24,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:16:24,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:16:24,457 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:16:24,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24, skipping insertion in model container [2018-12-09 10:16:24,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:16:24,484 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:16:24,665 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:16:24,709 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:16:24,746 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:16:24,776 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:16:24,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24 WrapperNode [2018-12-09 10:16:24,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:16:24,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:16:24,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:16:24,777 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:16:24,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:16:24,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:16:24,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:16:24,812 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:16:24,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (1/1) ... [2018-12-09 10:16:24,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:16:24,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:16:24,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:16:24,834 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:16:24,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:16:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:16:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:16:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 10:16:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:16:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 10:16:24,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 10:16:24,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 10:16:24,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 10:16:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 10:16:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:16:24,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:16:24,872 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 10:16:25,227 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:16:25,227 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 10:16:25,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:16:25 BoogieIcfgContainer [2018-12-09 10:16:25,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:16:25,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:16:25,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:16:25,230 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:16:25,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:16:24" (1/3) ... [2018-12-09 10:16:25,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4083e175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:16:25, skipping insertion in model container [2018-12-09 10:16:25,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:16:24" (2/3) ... [2018-12-09 10:16:25,231 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4083e175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:16:25, skipping insertion in model container [2018-12-09 10:16:25,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:16:25" (3/3) ... [2018-12-09 10:16:25,232 INFO L112 eAbstractionObserver]: Analyzing ICFG mix022_tso.opt_false-unreach-call.i [2018-12-09 10:16:25,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,257 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,257 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,257 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,258 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,259 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,260 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,261 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,261 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,261 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,261 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,261 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,261 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,262 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,263 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,264 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,265 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,266 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,267 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,268 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,269 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,270 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,271 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,272 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:16:25,280 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 10:16:25,280 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:16:25,286 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 10:16:25,295 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 10:16:25,310 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:16:25,310 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:16:25,310 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:16:25,310 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:16:25,310 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:16:25,310 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:16:25,310 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:16:25,310 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:16:25,317 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184places, 243 transitions [2018-12-09 10:16:30,192 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 75068 states. [2018-12-09 10:16:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 75068 states. [2018-12-09 10:16:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 10:16:30,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:30,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:30,201 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:30,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:30,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1573700734, now seen corresponding path program 1 times [2018-12-09 10:16:30,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:30,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:30,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:30,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:30,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:30,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:16:30,370 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:30,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:16:30,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:16:30,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:16:30,383 INFO L87 Difference]: Start difference. First operand 75068 states. Second operand 4 states. [2018-12-09 10:16:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:31,298 INFO L93 Difference]: Finished difference Result 142996 states and 583892 transitions. [2018-12-09 10:16:31,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:16:31,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-09 10:16:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:31,733 INFO L225 Difference]: With dead ends: 142996 [2018-12-09 10:16:31,733 INFO L226 Difference]: Without dead ends: 126812 [2018-12-09 10:16:31,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:16:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126812 states. [2018-12-09 10:16:33,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126812 to 67930. [2018-12-09 10:16:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67930 states. [2018-12-09 10:16:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67930 states to 67930 states and 279065 transitions. [2018-12-09 10:16:34,292 INFO L78 Accepts]: Start accepts. Automaton has 67930 states and 279065 transitions. Word has length 37 [2018-12-09 10:16:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:34,292 INFO L480 AbstractCegarLoop]: Abstraction has 67930 states and 279065 transitions. [2018-12-09 10:16:34,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:16:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 67930 states and 279065 transitions. [2018-12-09 10:16:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 10:16:34,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:34,295 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] [2018-12-09 10:16:34,295 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:34,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:34,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1444770339, now seen corresponding path program 1 times [2018-12-09 10:16:34,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:34,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:34,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:34,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:34,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:34,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:34,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:16:34,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:34,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:16:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:16:34,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:16:34,351 INFO L87 Difference]: Start difference. First operand 67930 states and 279065 transitions. Second operand 5 states. [2018-12-09 10:16:35,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:35,499 INFO L93 Difference]: Finished difference Result 201246 states and 776001 transitions. [2018-12-09 10:16:35,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:16:35,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 10:16:35,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:36,020 INFO L225 Difference]: With dead ends: 201246 [2018-12-09 10:16:36,021 INFO L226 Difference]: Without dead ends: 201086 [2018-12-09 10:16:36,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:16:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201086 states. [2018-12-09 10:16:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201086 to 109739. [2018-12-09 10:16:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109739 states. [2018-12-09 10:16:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109739 states to 109739 states and 422911 transitions. [2018-12-09 10:16:40,814 INFO L78 Accepts]: Start accepts. Automaton has 109739 states and 422911 transitions. Word has length 44 [2018-12-09 10:16:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:40,815 INFO L480 AbstractCegarLoop]: Abstraction has 109739 states and 422911 transitions. [2018-12-09 10:16:40,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:16:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 109739 states and 422911 transitions. [2018-12-09 10:16:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 10:16:40,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:40,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:40,821 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:40,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:40,821 INFO L82 PathProgramCache]: Analyzing trace with hash -991995994, now seen corresponding path program 1 times [2018-12-09 10:16:40,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:40,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:40,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:40,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:40,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:40,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:40,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:16:40,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:40,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:16:40,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:16:40,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:16:40,881 INFO L87 Difference]: Start difference. First operand 109739 states and 422911 transitions. Second operand 4 states. [2018-12-09 10:16:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:40,972 INFO L93 Difference]: Finished difference Result 26128 states and 89696 transitions. [2018-12-09 10:16:40,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:16:40,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 10:16:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:41,011 INFO L225 Difference]: With dead ends: 26128 [2018-12-09 10:16:41,011 INFO L226 Difference]: Without dead ends: 24431 [2018-12-09 10:16:41,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:16:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24431 states. [2018-12-09 10:16:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24431 to 24431. [2018-12-09 10:16:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24431 states. [2018-12-09 10:16:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24431 states to 24431 states and 84249 transitions. [2018-12-09 10:16:41,301 INFO L78 Accepts]: Start accepts. Automaton has 24431 states and 84249 transitions. Word has length 45 [2018-12-09 10:16:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:41,301 INFO L480 AbstractCegarLoop]: Abstraction has 24431 states and 84249 transitions. [2018-12-09 10:16:41,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:16:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 24431 states and 84249 transitions. [2018-12-09 10:16:41,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 10:16:41,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:41,304 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] [2018-12-09 10:16:41,304 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:41,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:41,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1579757532, now seen corresponding path program 1 times [2018-12-09 10:16:41,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:41,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:41,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:41,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:41,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:41,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:41,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:16:41,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:41,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:16:41,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:16:41,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:16:41,358 INFO L87 Difference]: Start difference. First operand 24431 states and 84249 transitions. Second operand 4 states. [2018-12-09 10:16:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:41,624 INFO L93 Difference]: Finished difference Result 33039 states and 111277 transitions. [2018-12-09 10:16:41,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:16:41,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 10:16:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:41,670 INFO L225 Difference]: With dead ends: 33039 [2018-12-09 10:16:41,670 INFO L226 Difference]: Without dead ends: 33039 [2018-12-09 10:16:41,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:16:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33039 states. [2018-12-09 10:16:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33039 to 27711. [2018-12-09 10:16:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27711 states. [2018-12-09 10:16:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27711 states to 27711 states and 94397 transitions. [2018-12-09 10:16:42,264 INFO L78 Accepts]: Start accepts. Automaton has 27711 states and 94397 transitions. Word has length 58 [2018-12-09 10:16:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:42,264 INFO L480 AbstractCegarLoop]: Abstraction has 27711 states and 94397 transitions. [2018-12-09 10:16:42,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:16:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 27711 states and 94397 transitions. [2018-12-09 10:16:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 10:16:42,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:42,269 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] [2018-12-09 10:16:42,269 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:42,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:42,269 INFO L82 PathProgramCache]: Analyzing trace with hash -992403568, now seen corresponding path program 1 times [2018-12-09 10:16:42,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:42,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:42,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:42,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:42,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:42,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:42,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:16:42,309 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:42,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:16:42,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:16:42,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:16:42,310 INFO L87 Difference]: Start difference. First operand 27711 states and 94397 transitions. Second operand 4 states. [2018-12-09 10:16:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:42,847 INFO L93 Difference]: Finished difference Result 34248 states and 114231 transitions. [2018-12-09 10:16:42,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:16:42,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 10:16:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:42,893 INFO L225 Difference]: With dead ends: 34248 [2018-12-09 10:16:42,893 INFO L226 Difference]: Without dead ends: 34248 [2018-12-09 10:16:42,894 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 10:16:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34248 states. [2018-12-09 10:16:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34248 to 31773. [2018-12-09 10:16:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31773 states. [2018-12-09 10:16:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31773 states to 31773 states and 107008 transitions. [2018-12-09 10:16:43,281 INFO L78 Accepts]: Start accepts. Automaton has 31773 states and 107008 transitions. Word has length 58 [2018-12-09 10:16:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:43,281 INFO L480 AbstractCegarLoop]: Abstraction has 31773 states and 107008 transitions. [2018-12-09 10:16:43,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:16:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 31773 states and 107008 transitions. [2018-12-09 10:16:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 10:16:43,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:43,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:43,286 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:43,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:43,286 INFO L82 PathProgramCache]: Analyzing trace with hash 360906129, now seen corresponding path program 1 times [2018-12-09 10:16:43,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:43,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:43,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:43,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:43,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:43,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:43,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:16:43,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:43,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:16:43,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:16:43,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:16:43,346 INFO L87 Difference]: Start difference. First operand 31773 states and 107008 transitions. Second operand 6 states. [2018-12-09 10:16:43,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:43,856 INFO L93 Difference]: Finished difference Result 46397 states and 155016 transitions. [2018-12-09 10:16:43,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:16:43,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 10:16:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:43,922 INFO L225 Difference]: With dead ends: 46397 [2018-12-09 10:16:43,923 INFO L226 Difference]: Without dead ends: 46365 [2018-12-09 10:16:43,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:16:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46365 states. [2018-12-09 10:16:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46365 to 37325. [2018-12-09 10:16:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37325 states. [2018-12-09 10:16:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37325 states to 37325 states and 124568 transitions. [2018-12-09 10:16:44,417 INFO L78 Accepts]: Start accepts. Automaton has 37325 states and 124568 transitions. Word has length 58 [2018-12-09 10:16:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:44,418 INFO L480 AbstractCegarLoop]: Abstraction has 37325 states and 124568 transitions. [2018-12-09 10:16:44,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:16:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37325 states and 124568 transitions. [2018-12-09 10:16:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 10:16:44,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:44,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:44,432 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:44,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:44,432 INFO L82 PathProgramCache]: Analyzing trace with hash -124637825, now seen corresponding path program 1 times [2018-12-09 10:16:44,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:44,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:44,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:44,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:44,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:44,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:16:44,480 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:44,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:16:44,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:16:44,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:16:44,481 INFO L87 Difference]: Start difference. First operand 37325 states and 124568 transitions. Second operand 4 states. [2018-12-09 10:16:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:45,241 INFO L93 Difference]: Finished difference Result 59481 states and 195605 transitions. [2018-12-09 10:16:45,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:16:45,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 10:16:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:45,332 INFO L225 Difference]: With dead ends: 59481 [2018-12-09 10:16:45,332 INFO L226 Difference]: Without dead ends: 59285 [2018-12-09 10:16:45,332 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 10:16:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59285 states. [2018-12-09 10:16:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59285 to 50769. [2018-12-09 10:16:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50769 states. [2018-12-09 10:16:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50769 states to 50769 states and 168555 transitions. [2018-12-09 10:16:46,026 INFO L78 Accepts]: Start accepts. Automaton has 50769 states and 168555 transitions. Word has length 72 [2018-12-09 10:16:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:46,027 INFO L480 AbstractCegarLoop]: Abstraction has 50769 states and 168555 transitions. [2018-12-09 10:16:46,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:16:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 50769 states and 168555 transitions. [2018-12-09 10:16:46,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 10:16:46,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:46,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:46,046 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:46,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1228671872, now seen corresponding path program 1 times [2018-12-09 10:16:46,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:46,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:46,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:46,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:46,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:46,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:46,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:46,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:16:46,155 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:46,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:16:46,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:16:46,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:16:46,156 INFO L87 Difference]: Start difference. First operand 50769 states and 168555 transitions. Second operand 8 states. [2018-12-09 10:16:47,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:47,266 INFO L93 Difference]: Finished difference Result 74755 states and 241276 transitions. [2018-12-09 10:16:47,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 10:16:47,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-12-09 10:16:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:47,372 INFO L225 Difference]: With dead ends: 74755 [2018-12-09 10:16:47,372 INFO L226 Difference]: Without dead ends: 74491 [2018-12-09 10:16:47,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 10:16:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74491 states. [2018-12-09 10:16:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74491 to 59134. [2018-12-09 10:16:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59134 states. [2018-12-09 10:16:48,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59134 states to 59134 states and 194352 transitions. [2018-12-09 10:16:48,304 INFO L78 Accepts]: Start accepts. Automaton has 59134 states and 194352 transitions. Word has length 72 [2018-12-09 10:16:48,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:48,305 INFO L480 AbstractCegarLoop]: Abstraction has 59134 states and 194352 transitions. [2018-12-09 10:16:48,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:16:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 59134 states and 194352 transitions. [2018-12-09 10:16:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 10:16:48,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:48,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:48,328 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:48,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:48,328 INFO L82 PathProgramCache]: Analyzing trace with hash 935268865, now seen corresponding path program 1 times [2018-12-09 10:16:48,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:48,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:48,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:48,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:48,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:48,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:48,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:48,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 10:16:48,427 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:48,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 10:16:48,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 10:16:48,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:16:48,428 INFO L87 Difference]: Start difference. First operand 59134 states and 194352 transitions. Second operand 9 states. [2018-12-09 10:16:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:49,797 INFO L93 Difference]: Finished difference Result 78707 states and 251859 transitions. [2018-12-09 10:16:49,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 10:16:49,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2018-12-09 10:16:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:49,907 INFO L225 Difference]: With dead ends: 78707 [2018-12-09 10:16:49,907 INFO L226 Difference]: Without dead ends: 78643 [2018-12-09 10:16:49,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2018-12-09 10:16:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78643 states. [2018-12-09 10:16:50,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78643 to 72623. [2018-12-09 10:16:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72623 states. [2018-12-09 10:16:50,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72623 states to 72623 states and 234371 transitions. [2018-12-09 10:16:50,797 INFO L78 Accepts]: Start accepts. Automaton has 72623 states and 234371 transitions. Word has length 72 [2018-12-09 10:16:50,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:50,797 INFO L480 AbstractCegarLoop]: Abstraction has 72623 states and 234371 transitions. [2018-12-09 10:16:50,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 10:16:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 72623 states and 234371 transitions. [2018-12-09 10:16:50,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 10:16:50,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:50,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:50,835 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:50,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash -565188377, now seen corresponding path program 1 times [2018-12-09 10:16:50,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:50,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:50,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:50,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:16:50,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:50,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:16:50,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:16:50,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:16:50,902 INFO L87 Difference]: Start difference. First operand 72623 states and 234371 transitions. Second operand 8 states. [2018-12-09 10:16:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:52,230 INFO L93 Difference]: Finished difference Result 79891 states and 256454 transitions. [2018-12-09 10:16:52,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 10:16:52,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-09 10:16:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:52,350 INFO L225 Difference]: With dead ends: 79891 [2018-12-09 10:16:52,350 INFO L226 Difference]: Without dead ends: 79827 [2018-12-09 10:16:52,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-09 10:16:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79827 states. [2018-12-09 10:16:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79827 to 73023. [2018-12-09 10:16:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73023 states. [2018-12-09 10:16:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73023 states to 73023 states and 235687 transitions. [2018-12-09 10:16:53,347 INFO L78 Accepts]: Start accepts. Automaton has 73023 states and 235687 transitions. Word has length 78 [2018-12-09 10:16:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:53,347 INFO L480 AbstractCegarLoop]: Abstraction has 73023 states and 235687 transitions. [2018-12-09 10:16:53,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:16:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 73023 states and 235687 transitions. [2018-12-09 10:16:53,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 10:16:53,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:53,396 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 10:16:53,396 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:53,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:53,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1215138116, now seen corresponding path program 1 times [2018-12-09 10:16:53,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:53,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:53,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:53,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:53,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:53,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:53,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:16:53,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:53,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:16:53,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:16:53,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:16:53,433 INFO L87 Difference]: Start difference. First operand 73023 states and 235687 transitions. Second operand 3 states. [2018-12-09 10:16:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:53,653 INFO L93 Difference]: Finished difference Result 69215 states and 221519 transitions. [2018-12-09 10:16:53,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:16:53,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 10:16:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:53,745 INFO L225 Difference]: With dead ends: 69215 [2018-12-09 10:16:53,745 INFO L226 Difference]: Without dead ends: 68987 [2018-12-09 10:16:53,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:16:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68987 states. [2018-12-09 10:16:54,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68987 to 68947. [2018-12-09 10:16:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68947 states. [2018-12-09 10:16:54,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68947 states to 68947 states and 220742 transitions. [2018-12-09 10:16:54,526 INFO L78 Accepts]: Start accepts. Automaton has 68947 states and 220742 transitions. Word has length 81 [2018-12-09 10:16:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:54,526 INFO L480 AbstractCegarLoop]: Abstraction has 68947 states and 220742 transitions. [2018-12-09 10:16:54,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:16:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 68947 states and 220742 transitions. [2018-12-09 10:16:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 10:16:54,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:54,565 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 10:16:54,566 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:54,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash -513834087, now seen corresponding path program 1 times [2018-12-09 10:16:54,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:54,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:54,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:54,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:54,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:54,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:54,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:54,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:16:54,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:54,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:16:54,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:16:54,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:16:54,623 INFO L87 Difference]: Start difference. First operand 68947 states and 220742 transitions. Second operand 6 states. [2018-12-09 10:16:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:55,152 INFO L93 Difference]: Finished difference Result 69015 states and 220735 transitions. [2018-12-09 10:16:55,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:16:55,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-09 10:16:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:55,254 INFO L225 Difference]: With dead ends: 69015 [2018-12-09 10:16:55,254 INFO L226 Difference]: Without dead ends: 69015 [2018-12-09 10:16:55,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:16:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69015 states. [2018-12-09 10:16:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69015 to 67394. [2018-12-09 10:16:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67394 states. [2018-12-09 10:16:56,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67394 states to 67394 states and 216329 transitions. [2018-12-09 10:16:56,141 INFO L78 Accepts]: Start accepts. Automaton has 67394 states and 216329 transitions. Word has length 81 [2018-12-09 10:16:56,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:56,141 INFO L480 AbstractCegarLoop]: Abstraction has 67394 states and 216329 transitions. [2018-12-09 10:16:56,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:16:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 67394 states and 216329 transitions. [2018-12-09 10:16:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 10:16:56,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:56,179 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 10:16:56,180 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:56,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1845472922, now seen corresponding path program 1 times [2018-12-09 10:16:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:56,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:56,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:56,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:56,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:16:56,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:56,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:16:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:16:56,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:16:56,237 INFO L87 Difference]: Start difference. First operand 67394 states and 216329 transitions. Second operand 7 states. [2018-12-09 10:16:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:56,788 INFO L93 Difference]: Finished difference Result 72555 states and 231919 transitions. [2018-12-09 10:16:56,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 10:16:56,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-12-09 10:16:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:56,890 INFO L225 Difference]: With dead ends: 72555 [2018-12-09 10:16:56,890 INFO L226 Difference]: Without dead ends: 72555 [2018-12-09 10:16:56,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:16:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72555 states. [2018-12-09 10:16:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72555 to 68985. [2018-12-09 10:16:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68985 states. [2018-12-09 10:16:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68985 states to 68985 states and 220736 transitions. [2018-12-09 10:16:57,742 INFO L78 Accepts]: Start accepts. Automaton has 68985 states and 220736 transitions. Word has length 81 [2018-12-09 10:16:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:57,742 INFO L480 AbstractCegarLoop]: Abstraction has 68985 states and 220736 transitions. [2018-12-09 10:16:57,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:16:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 68985 states and 220736 transitions. [2018-12-09 10:16:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 10:16:57,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:57,784 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 10:16:57,784 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:57,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2119728613, now seen corresponding path program 1 times [2018-12-09 10:16:57,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:57,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:57,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:57,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:57,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:57,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:57,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:16:57,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:57,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:16:57,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:16:57,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:16:57,818 INFO L87 Difference]: Start difference. First operand 68985 states and 220736 transitions. Second operand 5 states. [2018-12-09 10:16:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:57,849 INFO L93 Difference]: Finished difference Result 9157 states and 23573 transitions. [2018-12-09 10:16:57,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:16:57,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-09 10:16:57,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:57,855 INFO L225 Difference]: With dead ends: 9157 [2018-12-09 10:16:57,855 INFO L226 Difference]: Without dead ends: 7343 [2018-12-09 10:16:57,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:16:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2018-12-09 10:16:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 6133. [2018-12-09 10:16:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6133 states. [2018-12-09 10:16:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6133 states to 6133 states and 15707 transitions. [2018-12-09 10:16:57,905 INFO L78 Accepts]: Start accepts. Automaton has 6133 states and 15707 transitions. Word has length 81 [2018-12-09 10:16:57,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:57,905 INFO L480 AbstractCegarLoop]: Abstraction has 6133 states and 15707 transitions. [2018-12-09 10:16:57,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:16:57,905 INFO L276 IsEmpty]: Start isEmpty. Operand 6133 states and 15707 transitions. [2018-12-09 10:16:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:16:57,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:57,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:57,910 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:57,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:57,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1625342356, now seen corresponding path program 1 times [2018-12-09 10:16:57,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:57,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:57,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:57,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:57,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:57,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:57,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:16:57,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:57,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:16:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:16:57,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:16:57,979 INFO L87 Difference]: Start difference. First operand 6133 states and 15707 transitions. Second operand 7 states. [2018-12-09 10:16:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:58,303 INFO L93 Difference]: Finished difference Result 6890 states and 17440 transitions. [2018-12-09 10:16:58,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:16:58,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 10:16:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:58,307 INFO L225 Difference]: With dead ends: 6890 [2018-12-09 10:16:58,308 INFO L226 Difference]: Without dead ends: 6890 [2018-12-09 10:16:58,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:16:58,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6890 states. [2018-12-09 10:16:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6890 to 6202. [2018-12-09 10:16:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6202 states. [2018-12-09 10:16:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6202 states to 6202 states and 15865 transitions. [2018-12-09 10:16:58,354 INFO L78 Accepts]: Start accepts. Automaton has 6202 states and 15865 transitions. Word has length 109 [2018-12-09 10:16:58,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:58,355 INFO L480 AbstractCegarLoop]: Abstraction has 6202 states and 15865 transitions. [2018-12-09 10:16:58,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:16:58,355 INFO L276 IsEmpty]: Start isEmpty. Operand 6202 states and 15865 transitions. [2018-12-09 10:16:58,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:16:58,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:58,359 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] [2018-12-09 10:16:58,359 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:58,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1423367768, now seen corresponding path program 2 times [2018-12-09 10:16:58,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:58,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:58,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:16:58,408 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:58,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:16:58,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:16:58,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:16:58,409 INFO L87 Difference]: Start difference. First operand 6202 states and 15865 transitions. Second operand 5 states. [2018-12-09 10:16:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:58,574 INFO L93 Difference]: Finished difference Result 6784 states and 17137 transitions. [2018-12-09 10:16:58,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:16:58,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-12-09 10:16:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:58,579 INFO L225 Difference]: With dead ends: 6784 [2018-12-09 10:16:58,579 INFO L226 Difference]: Without dead ends: 6784 [2018-12-09 10:16:58,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:16:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2018-12-09 10:16:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 6224. [2018-12-09 10:16:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2018-12-09 10:16:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 15911 transitions. [2018-12-09 10:16:58,626 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 15911 transitions. Word has length 109 [2018-12-09 10:16:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:58,626 INFO L480 AbstractCegarLoop]: Abstraction has 6224 states and 15911 transitions. [2018-12-09 10:16:58,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:16:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 15911 transitions. [2018-12-09 10:16:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:16:58,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:58,630 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] [2018-12-09 10:16:58,630 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:58,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2046386566, now seen corresponding path program 1 times [2018-12-09 10:16:58,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:58,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:58,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:58,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:58,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:16:58,673 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:58,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:16:58,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:16:58,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:16:58,674 INFO L87 Difference]: Start difference. First operand 6224 states and 15911 transitions. Second operand 4 states. [2018-12-09 10:16:58,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:58,764 INFO L93 Difference]: Finished difference Result 6812 states and 17286 transitions. [2018-12-09 10:16:58,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:16:58,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-09 10:16:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:58,769 INFO L225 Difference]: With dead ends: 6812 [2018-12-09 10:16:58,769 INFO L226 Difference]: Without dead ends: 6784 [2018-12-09 10:16:58,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:16:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6784 states. [2018-12-09 10:16:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6784 to 6441. [2018-12-09 10:16:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6441 states. [2018-12-09 10:16:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 16398 transitions. [2018-12-09 10:16:58,817 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 16398 transitions. Word has length 109 [2018-12-09 10:16:58,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:58,817 INFO L480 AbstractCegarLoop]: Abstraction has 6441 states and 16398 transitions. [2018-12-09 10:16:58,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:16:58,817 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 16398 transitions. [2018-12-09 10:16:58,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:16:58,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:58,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:16:58,822 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:58,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:58,823 INFO L82 PathProgramCache]: Analyzing trace with hash 863039269, now seen corresponding path program 1 times [2018-12-09 10:16:58,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:58,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:58,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:58,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:58,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:58,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:16:58,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:58,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:16:58,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:16:58,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:16:58,885 INFO L87 Difference]: Start difference. First operand 6441 states and 16398 transitions. Second operand 7 states. [2018-12-09 10:16:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:59,237 INFO L93 Difference]: Finished difference Result 9514 states and 23392 transitions. [2018-12-09 10:16:59,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 10:16:59,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 10:16:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:59,243 INFO L225 Difference]: With dead ends: 9514 [2018-12-09 10:16:59,243 INFO L226 Difference]: Without dead ends: 9241 [2018-12-09 10:16:59,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:16:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9241 states. [2018-12-09 10:16:59,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9241 to 8721. [2018-12-09 10:16:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8721 states. [2018-12-09 10:16:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8721 states to 8721 states and 21776 transitions. [2018-12-09 10:16:59,309 INFO L78 Accepts]: Start accepts. Automaton has 8721 states and 21776 transitions. Word has length 109 [2018-12-09 10:16:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:59,310 INFO L480 AbstractCegarLoop]: Abstraction has 8721 states and 21776 transitions. [2018-12-09 10:16:59,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:16:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 8721 states and 21776 transitions. [2018-12-09 10:16:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:16:59,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:59,316 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] [2018-12-09 10:16:59,316 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:59,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash -568712637, now seen corresponding path program 2 times [2018-12-09 10:16:59,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:59,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:16:59,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:59,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:59,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:59,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:16:59,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:59,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:16:59,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:16:59,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:16:59,391 INFO L87 Difference]: Start difference. First operand 8721 states and 21776 transitions. Second operand 7 states. [2018-12-09 10:16:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:16:59,607 INFO L93 Difference]: Finished difference Result 13691 states and 32807 transitions. [2018-12-09 10:16:59,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:16:59,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 10:16:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:16:59,616 INFO L225 Difference]: With dead ends: 13691 [2018-12-09 10:16:59,617 INFO L226 Difference]: Without dead ends: 13651 [2018-12-09 10:16:59,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:16:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13651 states. [2018-12-09 10:16:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13651 to 11112. [2018-12-09 10:16:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11112 states. [2018-12-09 10:16:59,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11112 states to 11112 states and 27180 transitions. [2018-12-09 10:16:59,717 INFO L78 Accepts]: Start accepts. Automaton has 11112 states and 27180 transitions. Word has length 109 [2018-12-09 10:16:59,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:16:59,717 INFO L480 AbstractCegarLoop]: Abstraction has 11112 states and 27180 transitions. [2018-12-09 10:16:59,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:16:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 11112 states and 27180 transitions. [2018-12-09 10:16:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:16:59,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:16:59,726 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] [2018-12-09 10:16:59,726 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:16:59,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:16:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash -238946876, now seen corresponding path program 1 times [2018-12-09 10:16:59,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:16:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:59,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:16:59,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:16:59,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:16:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:16:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:16:59,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:16:59,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:16:59,807 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:16:59,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:16:59,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:16:59,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:16:59,807 INFO L87 Difference]: Start difference. First operand 11112 states and 27180 transitions. Second operand 8 states. [2018-12-09 10:17:00,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:17:00,264 INFO L93 Difference]: Finished difference Result 13691 states and 32920 transitions. [2018-12-09 10:17:00,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 10:17:00,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 109 [2018-12-09 10:17:00,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:17:00,273 INFO L225 Difference]: With dead ends: 13691 [2018-12-09 10:17:00,273 INFO L226 Difference]: Without dead ends: 13631 [2018-12-09 10:17:00,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-09 10:17:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13631 states. [2018-12-09 10:17:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13631 to 12092. [2018-12-09 10:17:00,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12092 states. [2018-12-09 10:17:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12092 states to 12092 states and 29503 transitions. [2018-12-09 10:17:00,377 INFO L78 Accepts]: Start accepts. Automaton has 12092 states and 29503 transitions. Word has length 109 [2018-12-09 10:17:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:17:00,378 INFO L480 AbstractCegarLoop]: Abstraction has 12092 states and 29503 transitions. [2018-12-09 10:17:00,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:17:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 12092 states and 29503 transitions. [2018-12-09 10:17:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:17:00,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:17:00,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:17:00,386 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:17:00,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:00,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1888572356, now seen corresponding path program 1 times [2018-12-09 10:17:00,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:17:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:00,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:17:00,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:00,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:17:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:00,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:17:00,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:17:00,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:17:00,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:17:00,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:17:00,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:17:00,450 INFO L87 Difference]: Start difference. First operand 12092 states and 29503 transitions. Second operand 6 states. [2018-12-09 10:17:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:17:00,666 INFO L93 Difference]: Finished difference Result 13816 states and 33301 transitions. [2018-12-09 10:17:00,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:17:00,667 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-09 10:17:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:17:00,676 INFO L225 Difference]: With dead ends: 13816 [2018-12-09 10:17:00,676 INFO L226 Difference]: Without dead ends: 13789 [2018-12-09 10:17:00,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:17:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-09 10:17:00,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 12551. [2018-12-09 10:17:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12551 states. [2018-12-09 10:17:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12551 states to 12551 states and 30505 transitions. [2018-12-09 10:17:00,817 INFO L78 Accepts]: Start accepts. Automaton has 12551 states and 30505 transitions. Word has length 109 [2018-12-09 10:17:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:17:00,817 INFO L480 AbstractCegarLoop]: Abstraction has 12551 states and 30505 transitions. [2018-12-09 10:17:00,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:17:00,818 INFO L276 IsEmpty]: Start isEmpty. Operand 12551 states and 30505 transitions. [2018-12-09 10:17:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 10:17:00,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:17:00,827 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] [2018-12-09 10:17:00,827 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:17:00,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:00,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1303893604, now seen corresponding path program 1 times [2018-12-09 10:17:00,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:17:00,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:00,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:17:00,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:00,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:17:00,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:00,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:17:00,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:17:00,880 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:17:00,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:17:00,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:17:00,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:17:00,881 INFO L87 Difference]: Start difference. First operand 12551 states and 30505 transitions. Second operand 6 states. [2018-12-09 10:17:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:17:01,069 INFO L93 Difference]: Finished difference Result 11549 states and 26997 transitions. [2018-12-09 10:17:01,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:17:01,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2018-12-09 10:17:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:17:01,077 INFO L225 Difference]: With dead ends: 11549 [2018-12-09 10:17:01,077 INFO L226 Difference]: Without dead ends: 11549 [2018-12-09 10:17:01,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:17:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11549 states. [2018-12-09 10:17:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11549 to 9682. [2018-12-09 10:17:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9682 states. [2018-12-09 10:17:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9682 states to 9682 states and 22915 transitions. [2018-12-09 10:17:01,153 INFO L78 Accepts]: Start accepts. Automaton has 9682 states and 22915 transitions. Word has length 109 [2018-12-09 10:17:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:17:01,153 INFO L480 AbstractCegarLoop]: Abstraction has 9682 states and 22915 transitions. [2018-12-09 10:17:01,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:17:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 9682 states and 22915 transitions. [2018-12-09 10:17:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 10:17:01,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:17:01,160 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 10:17:01,160 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:17:01,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:01,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1239013919, now seen corresponding path program 1 times [2018-12-09 10:17:01,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:17:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:01,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:17:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:01,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:17:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:01,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:17:01,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:17:01,230 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:17:01,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:17:01,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:17:01,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:17:01,231 INFO L87 Difference]: Start difference. First operand 9682 states and 22915 transitions. Second operand 8 states. [2018-12-09 10:17:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:17:01,745 INFO L93 Difference]: Finished difference Result 14774 states and 34050 transitions. [2018-12-09 10:17:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 10:17:01,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2018-12-09 10:17:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:17:01,755 INFO L225 Difference]: With dead ends: 14774 [2018-12-09 10:17:01,755 INFO L226 Difference]: Without dead ends: 14442 [2018-12-09 10:17:01,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-12-09 10:17:01,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14442 states. [2018-12-09 10:17:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14442 to 10742. [2018-12-09 10:17:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10742 states. [2018-12-09 10:17:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10742 states to 10742 states and 25290 transitions. [2018-12-09 10:17:01,852 INFO L78 Accepts]: Start accepts. Automaton has 10742 states and 25290 transitions. Word has length 111 [2018-12-09 10:17:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:17:01,853 INFO L480 AbstractCegarLoop]: Abstraction has 10742 states and 25290 transitions. [2018-12-09 10:17:01,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:17:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 10742 states and 25290 transitions. [2018-12-09 10:17:01,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 10:17:01,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:17:01,861 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 10:17:01,861 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:17:01,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2126184382, now seen corresponding path program 1 times [2018-12-09 10:17:01,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:17:01,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:01,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:17:01,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:01,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:17:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:01,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:17:01,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:17:01,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:17:01,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:17:01,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:17:01,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:17:01,920 INFO L87 Difference]: Start difference. First operand 10742 states and 25290 transitions. Second operand 7 states. [2018-12-09 10:17:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:17:02,190 INFO L93 Difference]: Finished difference Result 12008 states and 28114 transitions. [2018-12-09 10:17:02,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 10:17:02,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 10:17:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:17:02,199 INFO L225 Difference]: With dead ends: 12008 [2018-12-09 10:17:02,199 INFO L226 Difference]: Without dead ends: 12008 [2018-12-09 10:17:02,200 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 10:17:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12008 states. [2018-12-09 10:17:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12008 to 10883. [2018-12-09 10:17:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10883 states. [2018-12-09 10:17:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10883 states to 10883 states and 25572 transitions. [2018-12-09 10:17:02,286 INFO L78 Accepts]: Start accepts. Automaton has 10883 states and 25572 transitions. Word has length 111 [2018-12-09 10:17:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:17:02,286 INFO L480 AbstractCegarLoop]: Abstraction has 10883 states and 25572 transitions. [2018-12-09 10:17:02,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:17:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 10883 states and 25572 transitions. [2018-12-09 10:17:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 10:17:02,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:17:02,294 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 10:17:02,295 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:17:02,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:02,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1120293090, now seen corresponding path program 1 times [2018-12-09 10:17:02,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:17:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:02,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:17:02,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:02,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:17:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:02,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:17:02,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:17:02,352 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:17:02,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:17:02,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:17:02,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:17:02,353 INFO L87 Difference]: Start difference. First operand 10883 states and 25572 transitions. Second operand 5 states. [2018-12-09 10:17:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:17:02,389 INFO L93 Difference]: Finished difference Result 13244 states and 30924 transitions. [2018-12-09 10:17:02,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:17:02,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 10:17:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:17:02,398 INFO L225 Difference]: With dead ends: 13244 [2018-12-09 10:17:02,398 INFO L226 Difference]: Without dead ends: 13244 [2018-12-09 10:17:02,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:17:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13244 states. [2018-12-09 10:17:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13244 to 9600. [2018-12-09 10:17:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9600 states. [2018-12-09 10:17:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9600 states to 9600 states and 22273 transitions. [2018-12-09 10:17:02,484 INFO L78 Accepts]: Start accepts. Automaton has 9600 states and 22273 transitions. Word has length 111 [2018-12-09 10:17:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:17:02,484 INFO L480 AbstractCegarLoop]: Abstraction has 9600 states and 22273 transitions. [2018-12-09 10:17:02,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:17:02,484 INFO L276 IsEmpty]: Start isEmpty. Operand 9600 states and 22273 transitions. [2018-12-09 10:17:02,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 10:17:02,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:17:02,491 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 10:17:02,492 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:17:02,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:02,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1203734749, now seen corresponding path program 1 times [2018-12-09 10:17:02,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:17:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:02,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:17:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:02,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:17:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:02,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:17:02,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:17:02,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:17:02,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:17:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:17:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:17:02,542 INFO L87 Difference]: Start difference. First operand 9600 states and 22273 transitions. Second operand 5 states. [2018-12-09 10:17:02,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:17:02,664 INFO L93 Difference]: Finished difference Result 9792 states and 22657 transitions. [2018-12-09 10:17:02,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:17:02,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 10:17:02,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:17:02,670 INFO L225 Difference]: With dead ends: 9792 [2018-12-09 10:17:02,671 INFO L226 Difference]: Without dead ends: 9760 [2018-12-09 10:17:02,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:17:02,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2018-12-09 10:17:02,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 8599. [2018-12-09 10:17:02,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8599 states. [2018-12-09 10:17:02,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8599 states to 8599 states and 19914 transitions. [2018-12-09 10:17:02,736 INFO L78 Accepts]: Start accepts. Automaton has 8599 states and 19914 transitions. Word has length 111 [2018-12-09 10:17:02,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:17:02,736 INFO L480 AbstractCegarLoop]: Abstraction has 8599 states and 19914 transitions. [2018-12-09 10:17:02,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:17:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 8599 states and 19914 transitions. [2018-12-09 10:17:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 10:17:02,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:17:02,742 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 10:17:02,742 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:17:02,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:02,742 INFO L82 PathProgramCache]: Analyzing trace with hash 41029732, now seen corresponding path program 1 times [2018-12-09 10:17:02,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:17:02,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:02,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:17:02,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:02,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:17:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:02,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:17:02,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:17:02,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:17:02,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:17:02,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:17:02,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:17:02,795 INFO L87 Difference]: Start difference. First operand 8599 states and 19914 transitions. Second operand 5 states. [2018-12-09 10:17:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:17:02,939 INFO L93 Difference]: Finished difference Result 10702 states and 24458 transitions. [2018-12-09 10:17:02,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:17:02,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 10:17:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:17:02,946 INFO L225 Difference]: With dead ends: 10702 [2018-12-09 10:17:02,946 INFO L226 Difference]: Without dead ends: 10702 [2018-12-09 10:17:02,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:17:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10702 states. [2018-12-09 10:17:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10702 to 8025. [2018-12-09 10:17:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8025 states. [2018-12-09 10:17:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8025 states to 8025 states and 18564 transitions. [2018-12-09 10:17:03,010 INFO L78 Accepts]: Start accepts. Automaton has 8025 states and 18564 transitions. Word has length 111 [2018-12-09 10:17:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:17:03,010 INFO L480 AbstractCegarLoop]: Abstraction has 8025 states and 18564 transitions. [2018-12-09 10:17:03,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:17:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 8025 states and 18564 transitions. [2018-12-09 10:17:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:17:03,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:17:03,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:17:03,016 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:17:03,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2010295817, now seen corresponding path program 1 times [2018-12-09 10:17:03,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:17:03,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:03,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:17:03,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:03,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:17:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:17:03,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:17:03,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:17:03,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 10:17:03,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:17:03,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 10:17:03,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 10:17:03,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:17:03,087 INFO L87 Difference]: Start difference. First operand 8025 states and 18564 transitions. Second operand 9 states. [2018-12-09 10:17:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:17:03,183 INFO L93 Difference]: Finished difference Result 11005 states and 25925 transitions. [2018-12-09 10:17:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:17:03,183 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2018-12-09 10:17:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:17:03,186 INFO L225 Difference]: With dead ends: 11005 [2018-12-09 10:17:03,186 INFO L226 Difference]: Without dead ends: 3250 [2018-12-09 10:17:03,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:17:03,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2018-12-09 10:17:03,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2018-12-09 10:17:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3250 states. [2018-12-09 10:17:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 7827 transitions. [2018-12-09 10:17:03,207 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 7827 transitions. Word has length 113 [2018-12-09 10:17:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:17:03,207 INFO L480 AbstractCegarLoop]: Abstraction has 3250 states and 7827 transitions. [2018-12-09 10:17:03,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 10:17:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 7827 transitions. [2018-12-09 10:17:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:17:03,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:17:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:17:03,210 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:17:03,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:17:03,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1401095761, now seen corresponding path program 2 times [2018-12-09 10:17:03,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:17:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:03,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:17:03,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:17:03,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:17:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:17:03,252 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 10:17:03,322 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 10:17:03,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:17:03 BasicIcfg [2018-12-09 10:17:03,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:17:03,324 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:17:03,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:17:03,324 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:17:03,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:16:25" (3/4) ... [2018-12-09 10:17:03,326 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 10:17:03,406 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7313ef5f-f675-4180-b807-9b65484e23cc/bin-2019/utaipan/witness.graphml [2018-12-09 10:17:03,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:17:03,407 INFO L168 Benchmark]: Toolchain (without parser) took 38952.94 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.6 GB). Free memory was 947.0 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-09 10:17:03,408 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 10:17:03,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:17:03,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.06 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 10:17:03,408 INFO L168 Benchmark]: Boogie Preprocessor took 21.65 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 10:17:03,408 INFO L168 Benchmark]: RCFGBuilder took 393.66 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: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. [2018-12-09 10:17:03,409 INFO L168 Benchmark]: TraceAbstraction took 38095.37 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-09 10:17:03,409 INFO L168 Benchmark]: Witness Printer took 82.85 ms. Allocated memory is still 5.6 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:17:03,410 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.06 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.65 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 393.66 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: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38095.37 ms. Allocated memory was 1.2 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 82.85 ms. Allocated memory is still 5.6 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 59.4 MB). Peak memory consumption was 59.4 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] -1 pthread_t t601; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] FCALL, FORK -1 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] -1 pthread_t t602; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] FCALL, FORK -1 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x$w_buff1 = x$w_buff0 [L722] 0 x$w_buff0 = 2 [L723] 0 x$w_buff1_used = x$w_buff0_used [L724] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L727] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L728] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L729] 0 x$r_buff0_thd2 = (_Bool)1 [L732] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L733] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L734] 0 x$flush_delayed = weak$$choice2 [L735] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L737] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 0 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L741] 0 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L742] EXPR 0 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L742] 0 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L743] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 x = x$flush_delayed ? x$mem_tmp : x [L745] 0 x$flush_delayed = (_Bool)0 [L748] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] 1 y = 1 [L704] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L707] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L707] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L707] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L708] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L708] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L709] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L710] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L711] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L751] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L751] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L752] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L753] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L753] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L755] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L778] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L783] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L784] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L789] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L790] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L791] -1 x$flush_delayed = weak$$choice2 [L792] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L794] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L795] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L796] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L797] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L798] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L799] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L800] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] -1 x = x$flush_delayed ? x$mem_tmp : x [L802] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 264 locations, 3 error locations. UNSAFE Result, 38.0s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 14.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11130 SDtfs, 13082 SDslu, 26636 SDs, 0 SdLazy, 13291 SolverSat, 742 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 78 SyntacticMatches, 26 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109739occurred in iteration=2, 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: 16.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 231811 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2571 NumberOfCodeBlocks, 2571 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2430 ConstructedInterpolants, 0 QuantifiedInterpolants, 529756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...