./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/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 08258cac1c4e1f0e965aa5b4c26772b067db5f0f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 09:42:11,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:42:11,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:42:11,107 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:42:11,108 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:42:11,108 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:42:11,109 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:42:11,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:42:11,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:42:11,111 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:42:11,111 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:42:11,111 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:42:11,112 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:42:11,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:42:11,113 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:42:11,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:42:11,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:42:11,114 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:42:11,115 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:42:11,116 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:42:11,116 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:42:11,117 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:42:11,118 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:42:11,118 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:42:11,118 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:42:11,119 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:42:11,119 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:42:11,119 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:42:11,120 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:42:11,120 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:42:11,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:42:11,121 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:42:11,121 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:42:11,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:42:11,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:42:11,122 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:42:11,122 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 09:42:11,129 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:42:11,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:42:11,130 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:42:11,130 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:42:11,130 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 09:42:11,130 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 09:42:11,130 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 09:42:11,130 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 09:42:11,130 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 09:42:11,131 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 09:42:11,131 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 09:42:11,131 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 09:42:11,131 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 09:42:11,131 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:42:11,131 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:42:11,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:42:11,132 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:42:11,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:42:11,132 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:42:11,132 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:42:11,132 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:42:11,132 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:42:11,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:42:11,133 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:42:11,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:42:11,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:42:11,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:42:11,133 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:42:11,133 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:42:11,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:42:11,134 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:42:11,134 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:42:11,134 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 09:42:11,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:42:11,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:42:11,134 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 09:42:11,134 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_87853599-82a3-4c20-be9e-e85ae03caba3/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 -> 08258cac1c4e1f0e965aa5b4c26772b067db5f0f [2018-12-09 09:42:11,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:42:11,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:42:11,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:42:11,163 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:42:11,163 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:42:11,164 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe010_pso.opt_false-unreach-call.i [2018-12-09 09:42:11,200 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/data/d78bfabea/7f1ad1e5905d4ae4ab2fa60e8e28696b/FLAG69071ee1d [2018-12-09 09:42:11,542 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:42:11,542 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/sv-benchmarks/c/pthread-wmm/safe010_pso.opt_false-unreach-call.i [2018-12-09 09:42:11,549 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/data/d78bfabea/7f1ad1e5905d4ae4ab2fa60e8e28696b/FLAG69071ee1d [2018-12-09 09:42:11,557 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/data/d78bfabea/7f1ad1e5905d4ae4ab2fa60e8e28696b [2018-12-09 09:42:11,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:42:11,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:42:11,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:42:11,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:42:11,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:42:11,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11, skipping insertion in model container [2018-12-09 09:42:11,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:42:11,597 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:42:11,790 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:42:11,798 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:42:11,876 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:42:11,907 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:42:11,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11 WrapperNode [2018-12-09 09:42:11,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:42:11,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:42:11,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:42:11,909 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:42:11,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:42:11,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:42:11,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:42:11,945 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:42:11,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (1/1) ... [2018-12-09 09:42:11,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:42:11,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:42:11,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:42:11,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:42:11,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/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 09:42:11,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 09:42:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 09:42:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 09:42:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 09:42:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 09:42:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 09:42:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 09:42:11,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 09:42:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 09:42:11,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:42:11,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:42:11,998 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 09:42:12,309 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:42:12,310 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 09:42:12,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:42:12 BoogieIcfgContainer [2018-12-09 09:42:12,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:42:12,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:42:12,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:42:12,312 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:42:12,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:42:11" (1/3) ... [2018-12-09 09:42:12,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5914f482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:42:12, skipping insertion in model container [2018-12-09 09:42:12,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:42:11" (2/3) ... [2018-12-09 09:42:12,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5914f482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:42:12, skipping insertion in model container [2018-12-09 09:42:12,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:42:12" (3/3) ... [2018-12-09 09:42:12,314 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_pso.opt_false-unreach-call.i [2018-12-09 09:42:12,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,335 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,335 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,335 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,335 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,335 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,335 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,336 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,337 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,338 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,339 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,339 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,339 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,340 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,341 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,342 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 09:42:12,345 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 09:42:12,345 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:42:12,350 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 09:42:12,359 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 09:42:12,374 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:42:12,374 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:42:12,374 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:42:12,374 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:42:12,374 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:42:12,374 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:42:12,374 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:42:12,374 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:42:12,381 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-09 09:42:13,223 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25103 states. [2018-12-09 09:42:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states. [2018-12-09 09:42:13,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 09:42:13,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:13,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:42:13,233 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:13,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash -969782754, now seen corresponding path program 1 times [2018-12-09 09:42:13,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:13,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:13,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:13,381 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 09:42:13,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:13,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:42:13,382 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:13,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:42:13,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:42:13,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:42:13,395 INFO L87 Difference]: Start difference. First operand 25103 states. Second operand 4 states. [2018-12-09 09:42:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:13,734 INFO L93 Difference]: Finished difference Result 45395 states and 177649 transitions. [2018-12-09 09:42:13,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:42:13,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-09 09:42:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:13,877 INFO L225 Difference]: With dead ends: 45395 [2018-12-09 09:42:13,877 INFO L226 Difference]: Without dead ends: 40635 [2018-12-09 09:42:13,878 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 09:42:14,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2018-12-09 09:42:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23669. [2018-12-09 09:42:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2018-12-09 09:42:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 92566 transitions. [2018-12-09 09:42:14,563 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 92566 transitions. Word has length 32 [2018-12-09 09:42:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:14,563 INFO L480 AbstractCegarLoop]: Abstraction has 23669 states and 92566 transitions. [2018-12-09 09:42:14,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:42:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 92566 transitions. [2018-12-09 09:42:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 09:42:14,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:14,566 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] [2018-12-09 09:42:14,566 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:14,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:14,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1661840205, now seen corresponding path program 1 times [2018-12-09 09:42:14,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:14,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:14,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:14,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:14,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:14,625 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 09:42:14,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:14,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:42:14,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:14,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:42:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:42:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:42:14,627 INFO L87 Difference]: Start difference. First operand 23669 states and 92566 transitions. Second operand 5 states. [2018-12-09 09:42:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:15,225 INFO L93 Difference]: Finished difference Result 64837 states and 241396 transitions. [2018-12-09 09:42:15,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:42:15,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-09 09:42:15,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:15,377 INFO L225 Difference]: With dead ends: 64837 [2018-12-09 09:42:15,377 INFO L226 Difference]: Without dead ends: 64677 [2018-12-09 09:42:15,377 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 09:42:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64677 states. [2018-12-09 09:42:16,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64677 to 37149. [2018-12-09 09:42:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37149 states. [2018-12-09 09:42:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37149 states to 37149 states and 138311 transitions. [2018-12-09 09:42:16,236 INFO L78 Accepts]: Start accepts. Automaton has 37149 states and 138311 transitions. Word has length 43 [2018-12-09 09:42:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:16,237 INFO L480 AbstractCegarLoop]: Abstraction has 37149 states and 138311 transitions. [2018-12-09 09:42:16,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:42:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 37149 states and 138311 transitions. [2018-12-09 09:42:16,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 09:42:16,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:16,240 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 09:42:16,241 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:16,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:16,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1508943518, now seen corresponding path program 1 times [2018-12-09 09:42:16,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:16,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:16,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:16,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:16,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:42:16,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:16,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:42:16,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:16,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:42:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:42:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:42:16,278 INFO L87 Difference]: Start difference. First operand 37149 states and 138311 transitions. Second operand 4 states. [2018-12-09 09:42:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:16,320 INFO L93 Difference]: Finished difference Result 12371 states and 41204 transitions. [2018-12-09 09:42:16,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:42:16,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-09 09:42:16,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:16,343 INFO L225 Difference]: With dead ends: 12371 [2018-12-09 09:42:16,343 INFO L226 Difference]: Without dead ends: 11850 [2018-12-09 09:42:16,344 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 09:42:16,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2018-12-09 09:42:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 11850. [2018-12-09 09:42:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11850 states. [2018-12-09 09:42:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11850 states to 11850 states and 39649 transitions. [2018-12-09 09:42:16,573 INFO L78 Accepts]: Start accepts. Automaton has 11850 states and 39649 transitions. Word has length 44 [2018-12-09 09:42:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:16,573 INFO L480 AbstractCegarLoop]: Abstraction has 11850 states and 39649 transitions. [2018-12-09 09:42:16,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:42:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 11850 states and 39649 transitions. [2018-12-09 09:42:16,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 09:42:16,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:16,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:42:16,576 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:16,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1699267050, now seen corresponding path program 1 times [2018-12-09 09:42:16,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:16,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:16,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:16,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:16,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:16,627 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 09:42:16,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:16,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:42:16,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:16,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:42:16,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:42:16,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:42:16,628 INFO L87 Difference]: Start difference. First operand 11850 states and 39649 transitions. Second operand 4 states. [2018-12-09 09:42:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:16,796 INFO L93 Difference]: Finished difference Result 17026 states and 55724 transitions. [2018-12-09 09:42:16,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:42:16,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-09 09:42:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:16,816 INFO L225 Difference]: With dead ends: 17026 [2018-12-09 09:42:16,817 INFO L226 Difference]: Without dead ends: 17026 [2018-12-09 09:42:16,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:42:16,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17026 states. [2018-12-09 09:42:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17026 to 12886. [2018-12-09 09:42:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12886 states. [2018-12-09 09:42:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 42751 transitions. [2018-12-09 09:42:16,987 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 42751 transitions. Word has length 57 [2018-12-09 09:42:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:16,987 INFO L480 AbstractCegarLoop]: Abstraction has 12886 states and 42751 transitions. [2018-12-09 09:42:16,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:42:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 42751 transitions. [2018-12-09 09:42:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 09:42:16,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:16,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:42:16,991 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:16,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:16,991 INFO L82 PathProgramCache]: Analyzing trace with hash -852889911, now seen corresponding path program 1 times [2018-12-09 09:42:16,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:16,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:16,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:16,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:16,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:17,053 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 09:42:17,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:17,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:42:17,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:17,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:42:17,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:42:17,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:42:17,053 INFO L87 Difference]: Start difference. First operand 12886 states and 42751 transitions. Second operand 4 states. [2018-12-09 09:42:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:17,419 INFO L93 Difference]: Finished difference Result 18381 states and 60008 transitions. [2018-12-09 09:42:17,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:42:17,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-09 09:42:17,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:17,440 INFO L225 Difference]: With dead ends: 18381 [2018-12-09 09:42:17,440 INFO L226 Difference]: Without dead ends: 18381 [2018-12-09 09:42:17,440 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 09:42:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18381 states. [2018-12-09 09:42:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18381 to 16342. [2018-12-09 09:42:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16342 states. [2018-12-09 09:42:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 53833 transitions. [2018-12-09 09:42:17,633 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 53833 transitions. Word has length 57 [2018-12-09 09:42:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:17,633 INFO L480 AbstractCegarLoop]: Abstraction has 16342 states and 53833 transitions. [2018-12-09 09:42:17,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:42:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 53833 transitions. [2018-12-09 09:42:17,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 09:42:17,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:17,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:42:17,638 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:17,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash 500419786, now seen corresponding path program 1 times [2018-12-09 09:42:17,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:17,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:17,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:17,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:17,702 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 09:42:17,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:17,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:42:17,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:17,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:42:17,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:42:17,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:42:17,703 INFO L87 Difference]: Start difference. First operand 16342 states and 53833 transitions. Second operand 6 states. [2018-12-09 09:42:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:17,968 INFO L93 Difference]: Finished difference Result 24888 states and 80174 transitions. [2018-12-09 09:42:17,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:42:17,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-09 09:42:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:18,000 INFO L225 Difference]: With dead ends: 24888 [2018-12-09 09:42:18,000 INFO L226 Difference]: Without dead ends: 24888 [2018-12-09 09:42:18,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:42:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24888 states. [2018-12-09 09:42:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24888 to 16252. [2018-12-09 09:42:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16252 states. [2018-12-09 09:42:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16252 states to 16252 states and 52196 transitions. [2018-12-09 09:42:18,264 INFO L78 Accepts]: Start accepts. Automaton has 16252 states and 52196 transitions. Word has length 57 [2018-12-09 09:42:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:18,264 INFO L480 AbstractCegarLoop]: Abstraction has 16252 states and 52196 transitions. [2018-12-09 09:42:18,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:42:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 16252 states and 52196 transitions. [2018-12-09 09:42:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 09:42:18,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:18,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 09:42:18,267 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:18,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash 207016779, now seen corresponding path program 1 times [2018-12-09 09:42:18,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:18,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:18,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:18,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:18,322 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 09:42:18,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:18,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:42:18,322 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:18,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:42:18,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:42:18,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:42:18,323 INFO L87 Difference]: Start difference. First operand 16252 states and 52196 transitions. Second operand 5 states. [2018-12-09 09:42:18,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:18,347 INFO L93 Difference]: Finished difference Result 2696 states and 7013 transitions. [2018-12-09 09:42:18,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 09:42:18,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 09:42:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:18,349 INFO L225 Difference]: With dead ends: 2696 [2018-12-09 09:42:18,349 INFO L226 Difference]: Without dead ends: 2224 [2018-12-09 09:42:18,350 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 09:42:18,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2018-12-09 09:42:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2150. [2018-12-09 09:42:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2018-12-09 09:42:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 5587 transitions. [2018-12-09 09:42:18,366 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 5587 transitions. Word has length 57 [2018-12-09 09:42:18,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:18,366 INFO L480 AbstractCegarLoop]: Abstraction has 2150 states and 5587 transitions. [2018-12-09 09:42:18,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:42:18,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 5587 transitions. [2018-12-09 09:42:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 09:42:18,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:18,368 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] [2018-12-09 09:42:18,368 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:18,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:18,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2072438205, now seen corresponding path program 1 times [2018-12-09 09:42:18,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:18,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:18,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:18,405 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 09:42:18,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:18,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:42:18,406 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:18,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:42:18,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:42:18,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:42:18,407 INFO L87 Difference]: Start difference. First operand 2150 states and 5587 transitions. Second operand 4 states. [2018-12-09 09:42:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:18,507 INFO L93 Difference]: Finished difference Result 3137 states and 7854 transitions. [2018-12-09 09:42:18,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:42:18,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 09:42:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:18,509 INFO L225 Difference]: With dead ends: 3137 [2018-12-09 09:42:18,510 INFO L226 Difference]: Without dead ends: 3137 [2018-12-09 09:42:18,510 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 09:42:18,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2018-12-09 09:42:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2234. [2018-12-09 09:42:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2018-12-09 09:42:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 5761 transitions. [2018-12-09 09:42:18,529 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 5761 transitions. Word has length 92 [2018-12-09 09:42:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:18,529 INFO L480 AbstractCegarLoop]: Abstraction has 2234 states and 5761 transitions. [2018-12-09 09:42:18,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:42:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 5761 transitions. [2018-12-09 09:42:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 09:42:18,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:18,532 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] [2018-12-09 09:42:18,532 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:18,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:18,532 INFO L82 PathProgramCache]: Analyzing trace with hash 889090908, now seen corresponding path program 1 times [2018-12-09 09:42:18,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:18,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:18,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:18,619 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 09:42:18,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:18,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:42:18,619 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:18,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:42:18,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:42:18,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:42:18,620 INFO L87 Difference]: Start difference. First operand 2234 states and 5761 transitions. Second operand 6 states. [2018-12-09 09:42:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:18,747 INFO L93 Difference]: Finished difference Result 2513 states and 6342 transitions. [2018-12-09 09:42:18,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:42:18,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 09:42:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:18,749 INFO L225 Difference]: With dead ends: 2513 [2018-12-09 09:42:18,749 INFO L226 Difference]: Without dead ends: 2513 [2018-12-09 09:42:18,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:42:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2018-12-09 09:42:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2048. [2018-12-09 09:42:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2018-12-09 09:42:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 5299 transitions. [2018-12-09 09:42:18,764 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 5299 transitions. Word has length 92 [2018-12-09 09:42:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:18,764 INFO L480 AbstractCegarLoop]: Abstraction has 2048 states and 5299 transitions. [2018-12-09 09:42:18,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:42:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 5299 transitions. [2018-12-09 09:42:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 09:42:18,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:18,766 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] [2018-12-09 09:42:18,766 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:18,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1759073572, now seen corresponding path program 1 times [2018-12-09 09:42:18,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:18,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:18,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:18,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:18,845 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 09:42:18,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:18,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:42:18,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:18,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:42:18,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:42:18,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:42:18,846 INFO L87 Difference]: Start difference. First operand 2048 states and 5299 transitions. Second operand 6 states. [2018-12-09 09:42:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:18,956 INFO L93 Difference]: Finished difference Result 2241 states and 5642 transitions. [2018-12-09 09:42:18,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 09:42:18,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 09:42:18,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:18,958 INFO L225 Difference]: With dead ends: 2241 [2018-12-09 09:42:18,958 INFO L226 Difference]: Without dead ends: 2241 [2018-12-09 09:42:18,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 09:42:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-12-09 09:42:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2072. [2018-12-09 09:42:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-12-09 09:42:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 5304 transitions. [2018-12-09 09:42:18,972 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 5304 transitions. Word has length 92 [2018-12-09 09:42:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:18,972 INFO L480 AbstractCegarLoop]: Abstraction has 2072 states and 5304 transitions. [2018-12-09 09:42:18,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:42:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 5304 transitions. [2018-12-09 09:42:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 09:42:18,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:18,974 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] [2018-12-09 09:42:18,974 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:18,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:18,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1511199803, now seen corresponding path program 1 times [2018-12-09 09:42:18,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:18,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:18,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:18,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:18,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:19,021 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 09:42:19,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:19,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:42:19,021 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:19,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:42:19,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:42:19,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:42:19,021 INFO L87 Difference]: Start difference. First operand 2072 states and 5304 transitions. Second operand 5 states. [2018-12-09 09:42:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:19,134 INFO L93 Difference]: Finished difference Result 2853 states and 7060 transitions. [2018-12-09 09:42:19,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:42:19,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 09:42:19,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:19,136 INFO L225 Difference]: With dead ends: 2853 [2018-12-09 09:42:19,136 INFO L226 Difference]: Without dead ends: 2853 [2018-12-09 09:42:19,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:42:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2018-12-09 09:42:19,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2244. [2018-12-09 09:42:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2018-12-09 09:42:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5654 transitions. [2018-12-09 09:42:19,153 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5654 transitions. Word has length 92 [2018-12-09 09:42:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:19,153 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 5654 transitions. [2018-12-09 09:42:19,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:42:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5654 transitions. [2018-12-09 09:42:19,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 09:42:19,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:19,155 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] [2018-12-09 09:42:19,156 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:19,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:19,156 INFO L82 PathProgramCache]: Analyzing trace with hash -48914670, now seen corresponding path program 2 times [2018-12-09 09:42:19,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:19,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:19,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:19,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:19,204 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 09:42:19,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:19,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 09:42:19,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:19,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 09:42:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 09:42:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 09:42:19,205 INFO L87 Difference]: Start difference. First operand 2244 states and 5654 transitions. Second operand 4 states. [2018-12-09 09:42:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:19,281 INFO L93 Difference]: Finished difference Result 2580 states and 6574 transitions. [2018-12-09 09:42:19,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 09:42:19,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 09:42:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:19,284 INFO L225 Difference]: With dead ends: 2580 [2018-12-09 09:42:19,284 INFO L226 Difference]: Without dead ends: 2580 [2018-12-09 09:42:19,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 09:42:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-12-09 09:42:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2548. [2018-12-09 09:42:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2018-12-09 09:42:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 6494 transitions. [2018-12-09 09:42:19,302 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 6494 transitions. Word has length 92 [2018-12-09 09:42:19,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:19,302 INFO L480 AbstractCegarLoop]: Abstraction has 2548 states and 6494 transitions. [2018-12-09 09:42:19,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 09:42:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 6494 transitions. [2018-12-09 09:42:19,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 09:42:19,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:19,304 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:19,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:19,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2126124013, now seen corresponding path program 1 times [2018-12-09 09:42:19,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:19,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:19,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 09:42:19,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:19,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:19,398 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 09:42:19,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:19,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 09:42:19,399 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:19,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 09:42:19,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 09:42:19,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:42:19,399 INFO L87 Difference]: Start difference. First operand 2548 states and 6494 transitions. Second operand 8 states. [2018-12-09 09:42:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:19,658 INFO L93 Difference]: Finished difference Result 3957 states and 10028 transitions. [2018-12-09 09:42:19,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 09:42:19,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-09 09:42:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:19,661 INFO L225 Difference]: With dead ends: 3957 [2018-12-09 09:42:19,661 INFO L226 Difference]: Without dead ends: 3925 [2018-12-09 09:42:19,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-12-09 09:42:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-12-09 09:42:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3392. [2018-12-09 09:42:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3392 states. [2018-12-09 09:42:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 8645 transitions. [2018-12-09 09:42:19,686 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 8645 transitions. Word has length 92 [2018-12-09 09:42:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:19,686 INFO L480 AbstractCegarLoop]: Abstraction has 3392 states and 8645 transitions. [2018-12-09 09:42:19,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 09:42:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 8645 transitions. [2018-12-09 09:42:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 09:42:19,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:19,689 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] [2018-12-09 09:42:19,689 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:19,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:19,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1164509996, now seen corresponding path program 1 times [2018-12-09 09:42:19,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:19,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:19,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:19,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:19,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 09:42:19,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:19,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 09:42:19,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:19,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 09:42:19,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 09:42:19,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 09:42:19,759 INFO L87 Difference]: Start difference. First operand 3392 states and 8645 transitions. Second operand 7 states. [2018-12-09 09:42:19,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:19,983 INFO L93 Difference]: Finished difference Result 4456 states and 11306 transitions. [2018-12-09 09:42:19,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 09:42:19,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-09 09:42:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:20,006 INFO L225 Difference]: With dead ends: 4456 [2018-12-09 09:42:20,006 INFO L226 Difference]: Without dead ends: 4456 [2018-12-09 09:42:20,006 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 09:42:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2018-12-09 09:42:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 3856. [2018-12-09 09:42:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3856 states. [2018-12-09 09:42:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 9887 transitions. [2018-12-09 09:42:20,040 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 9887 transitions. Word has length 92 [2018-12-09 09:42:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:20,040 INFO L480 AbstractCegarLoop]: Abstraction has 3856 states and 9887 transitions. [2018-12-09 09:42:20,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 09:42:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 9887 transitions. [2018-12-09 09:42:20,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 09:42:20,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:20,043 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] [2018-12-09 09:42:20,043 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:20,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:20,044 INFO L82 PathProgramCache]: Analyzing trace with hash 80254485, now seen corresponding path program 1 times [2018-12-09 09:42:20,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:20,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:20,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:20,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:20,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:20,112 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 09:42:20,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:20,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:42:20,113 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:20,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:42:20,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:42:20,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:42:20,113 INFO L87 Difference]: Start difference. First operand 3856 states and 9887 transitions. Second operand 5 states. [2018-12-09 09:42:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:20,147 INFO L93 Difference]: Finished difference Result 5688 states and 14819 transitions. [2018-12-09 09:42:20,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 09:42:20,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-09 09:42:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:20,153 INFO L225 Difference]: With dead ends: 5688 [2018-12-09 09:42:20,153 INFO L226 Difference]: Without dead ends: 5688 [2018-12-09 09:42:20,153 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 09:42:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2018-12-09 09:42:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 3422. [2018-12-09 09:42:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3422 states. [2018-12-09 09:42:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 8725 transitions. [2018-12-09 09:42:20,199 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 8725 transitions. Word has length 92 [2018-12-09 09:42:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:20,199 INFO L480 AbstractCegarLoop]: Abstraction has 3422 states and 8725 transitions. [2018-12-09 09:42:20,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:42:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 8725 transitions. [2018-12-09 09:42:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 09:42:20,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:20,202 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] [2018-12-09 09:42:20,202 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:20,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:20,202 INFO L82 PathProgramCache]: Analyzing trace with hash 560970901, now seen corresponding path program 1 times [2018-12-09 09:42:20,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:20,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:20,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:20,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:20,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:20,258 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 09:42:20,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:20,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 09:42:20,259 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:20,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 09:42:20,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 09:42:20,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 09:42:20,259 INFO L87 Difference]: Start difference. First operand 3422 states and 8725 transitions. Second operand 6 states. [2018-12-09 09:42:20,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:20,366 INFO L93 Difference]: Finished difference Result 2862 states and 7069 transitions. [2018-12-09 09:42:20,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:42:20,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-09 09:42:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:20,369 INFO L225 Difference]: With dead ends: 2862 [2018-12-09 09:42:20,369 INFO L226 Difference]: Without dead ends: 2862 [2018-12-09 09:42:20,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 09:42:20,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2018-12-09 09:42:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2067. [2018-12-09 09:42:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2018-12-09 09:42:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 5267 transitions. [2018-12-09 09:42:20,395 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 5267 transitions. Word has length 92 [2018-12-09 09:42:20,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:20,395 INFO L480 AbstractCegarLoop]: Abstraction has 2067 states and 5267 transitions. [2018-12-09 09:42:20,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 09:42:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 5267 transitions. [2018-12-09 09:42:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 09:42:20,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:20,397 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] [2018-12-09 09:42:20,397 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:20,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:20,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1613356635, now seen corresponding path program 1 times [2018-12-09 09:42:20,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:20,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:20,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:20,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:20,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:20,447 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 09:42:20,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:20,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 09:42:20,448 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:20,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 09:42:20,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 09:42:20,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 09:42:20,448 INFO L87 Difference]: Start difference. First operand 2067 states and 5267 transitions. Second operand 5 states. [2018-12-09 09:42:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:20,542 INFO L93 Difference]: Finished difference Result 2387 states and 6067 transitions. [2018-12-09 09:42:20,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 09:42:20,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 09:42:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:20,545 INFO L225 Difference]: With dead ends: 2387 [2018-12-09 09:42:20,545 INFO L226 Difference]: Without dead ends: 2387 [2018-12-09 09:42:20,545 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 09:42:20,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2018-12-09 09:42:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2115. [2018-12-09 09:42:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-12-09 09:42:20,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 5387 transitions. [2018-12-09 09:42:20,560 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 5387 transitions. Word has length 94 [2018-12-09 09:42:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:20,560 INFO L480 AbstractCegarLoop]: Abstraction has 2115 states and 5387 transitions. [2018-12-09 09:42:20,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 09:42:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 5387 transitions. [2018-12-09 09:42:20,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 09:42:20,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:20,562 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] [2018-12-09 09:42:20,562 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:20,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:20,562 INFO L82 PathProgramCache]: Analyzing trace with hash -368592154, now seen corresponding path program 1 times [2018-12-09 09:42:20,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:20,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:20,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:20,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:20,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:42:20,666 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 09:42:20,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:42:20,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 09:42:20,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 09:42:20,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 09:42:20,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 09:42:20,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 09:42:20,667 INFO L87 Difference]: Start difference. First operand 2115 states and 5387 transitions. Second operand 12 states. [2018-12-09 09:42:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:42:21,051 INFO L93 Difference]: Finished difference Result 3902 states and 10089 transitions. [2018-12-09 09:42:21,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 09:42:21,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-09 09:42:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:42:21,053 INFO L225 Difference]: With dead ends: 3902 [2018-12-09 09:42:21,053 INFO L226 Difference]: Without dead ends: 2926 [2018-12-09 09:42:21,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 09:42:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2018-12-09 09:42:21,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2646. [2018-12-09 09:42:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2646 states. [2018-12-09 09:42:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 6640 transitions. [2018-12-09 09:42:21,072 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 6640 transitions. Word has length 94 [2018-12-09 09:42:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:42:21,072 INFO L480 AbstractCegarLoop]: Abstraction has 2646 states and 6640 transitions. [2018-12-09 09:42:21,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 09:42:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 6640 transitions. [2018-12-09 09:42:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 09:42:21,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:42:21,075 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] [2018-12-09 09:42:21,075 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:42:21,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:42:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash -822908468, now seen corresponding path program 2 times [2018-12-09 09:42:21,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 09:42:21,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:21,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:42:21,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:42:21,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 09:42:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:42:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:42:21,132 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:42:21,192 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 09:42:21,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:42:21 BasicIcfg [2018-12-09 09:42:21,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:42:21,193 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:42:21,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:42:21,194 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:42:21,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:42:12" (3/4) ... [2018-12-09 09:42:21,195 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 09:42:21,259 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_87853599-82a3-4c20-be9e-e85ae03caba3/bin-2019/utaipan/witness.graphml [2018-12-09 09:42:21,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:42:21,259 INFO L168 Benchmark]: Toolchain (without parser) took 9699.58 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 945.9 MB in the beginning and 1.4 GB in the end (delta: -450.1 MB). Peak memory consumption was 712.3 MB. Max. memory is 11.5 GB. [2018-12-09 09:42:21,260 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:42:21,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -150.0 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-12-09 09:42:21,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:42:21,261 INFO L168 Benchmark]: Boogie Preprocessor took 19.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:42:21,261 INFO L168 Benchmark]: RCFGBuilder took 345.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:42:21,261 INFO L168 Benchmark]: TraceAbstraction took 8882.85 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -372.4 MB). Peak memory consumption was 672.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:42:21,261 INFO L168 Benchmark]: Witness Printer took 65.29 ms. Allocated memory is still 2.2 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-12-09 09:42:21,262 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 347.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -150.0 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 345.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8882.85 ms. Allocated memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -372.4 MB). Peak memory consumption was 672.0 MB. Max. memory is 11.5 GB. * Witness Printer took 65.29 ms. Allocated memory is still 2.2 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 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] [L674] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L675] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L677] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L679] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L680] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L681] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L682] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L683] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L684] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L685] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L686] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L687] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L688] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L689] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L690] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L691] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L692] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L693] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L694] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L695] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] -1 pthread_t t2017; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] FCALL, FORK -1 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] 0 y$w_buff1 = y$w_buff0 [L700] 0 y$w_buff0 = 2 [L701] 0 y$w_buff1_used = y$w_buff0_used [L702] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L704] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L705] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L706] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L707] 0 y$r_buff0_thd1 = (_Bool)1 [L710] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] -1 pthread_t t2018; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] FCALL, FORK -1 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 __unbuffered_p1_EAX = x [L730] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L713] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L714] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L733] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L714] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L715] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L715] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L716] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L716] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L717] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L720] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L733] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L765] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L766] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L767] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L768] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L771] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L772] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L773] -1 y$flush_delayed = weak$$choice2 [L774] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L776] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L777] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L778] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L780] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L781] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L782] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] -1 y = y$flush_delayed ? y$mem_tmp : y [L784] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 179 locations, 3 error locations. UNSAFE Result, 8.8s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4250 SDtfs, 3874 SDslu, 10039 SDs, 0 SdLazy, 3412 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 49 SyntacticMatches, 18 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37149occurred 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: 2.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 66307 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1457 NumberOfCodeBlocks, 1457 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1345 ConstructedInterpolants, 0 QuantifiedInterpolants, 287841 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...