./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc_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_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f5ae702128f84b20d08e8523b7c9183613a7383 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:36:56,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:36:56,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:36:56,134 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:36:56,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:36:56,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:36:56,135 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:36:56,136 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:36:56,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:36:56,137 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:36:56,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:36:56,138 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:36:56,138 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:36:56,139 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:36:56,139 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:36:56,140 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:36:56,140 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:36:56,141 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:36:56,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:36:56,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:36:56,143 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:36:56,144 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:36:56,145 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:36:56,145 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:36:56,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:36:56,145 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:36:56,146 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:36:56,146 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:36:56,147 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:36:56,147 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:36:56,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:36:56,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:36:56,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:36:56,148 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:36:56,148 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:36:56,149 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:36:56,149 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 09:36:56,156 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:36:56,156 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:36:56,156 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 09:36:56,156 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 09:36:56,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:36:56,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:36:56,157 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:36:56,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:36:56,157 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:36:56,157 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:36:56,157 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:36:56,157 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:36:56,157 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 09:36:56,158 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 09:36:56,158 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 09:36:56,158 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:36:56,158 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:36:56,158 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:36:56,158 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 09:36:56,158 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:36:56,158 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:36:56,158 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 09:36:56,158 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 09:36:56,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:36:56,158 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:36:56,159 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 09:36:56,159 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 09:36:56,159 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:36:56,159 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 09:36:56,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 09:36:56,159 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer 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 -> Automizer 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 -> 6f5ae702128f84b20d08e8523b7c9183613a7383 [2018-12-08 09:36:56,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:36:56,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:36:56,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:36:56,189 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:36:56,189 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:36:56,190 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe010_pso.oepc_false-unreach-call.i [2018-12-08 09:36:56,228 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/data/e0bf321ee/9a1984ed654040daa2705bdd639a5396/FLAGa76d13584 [2018-12-08 09:36:56,632 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:36:56,633 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/sv-benchmarks/c/pthread-wmm/safe010_pso.oepc_false-unreach-call.i [2018-12-08 09:36:56,639 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/data/e0bf321ee/9a1984ed654040daa2705bdd639a5396/FLAGa76d13584 [2018-12-08 09:36:56,969 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/data/e0bf321ee/9a1984ed654040daa2705bdd639a5396 [2018-12-08 09:36:56,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:36:56,977 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:36:56,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:36:56,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:36:56,986 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:36:56,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:36:56" (1/1) ... [2018-12-08 09:36:56,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340b48b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:56, skipping insertion in model container [2018-12-08 09:36:56,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:36:56" (1/1) ... [2018-12-08 09:36:57,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:36:57,022 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:36:57,214 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:36:57,223 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:36:57,303 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:36:57,345 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:36:57,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57 WrapperNode [2018-12-08 09:36:57,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:36:57,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:36:57,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:36:57,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:36:57,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (1/1) ... [2018-12-08 09:36:57,363 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (1/1) ... [2018-12-08 09:36:57,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:36:57,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:36:57,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:36:57,381 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:36:57,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (1/1) ... [2018-12-08 09:36:57,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (1/1) ... [2018-12-08 09:36:57,389 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (1/1) ... [2018-12-08 09:36:57,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (1/1) ... [2018-12-08 09:36:57,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (1/1) ... [2018-12-08 09:36:57,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (1/1) ... [2018-12-08 09:36:57,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (1/1) ... [2018-12-08 09:36:57,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:36:57,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:36:57,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:36:57,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:36:57,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:36:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:36:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:36:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 09:36:57,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:36:57,434 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 09:36:57,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 09:36:57,434 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 09:36:57,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 09:36:57,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 09:36:57,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:36:57,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:36:57,435 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 09:36:57,730 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:36:57,731 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 09:36:57,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:36:57 BoogieIcfgContainer [2018-12-08 09:36:57,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:36:57,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 09:36:57,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 09:36:57,733 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 09:36:57,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 09:36:56" (1/3) ... [2018-12-08 09:36:57,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16688be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:36:57, skipping insertion in model container [2018-12-08 09:36:57,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:36:57" (2/3) ... [2018-12-08 09:36:57,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16688be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:36:57, skipping insertion in model container [2018-12-08 09:36:57,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:36:57" (3/3) ... [2018-12-08 09:36:57,735 INFO L112 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc_false-unreach-call.i [2018-12-08 09:36:57,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,756 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,756 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,756 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,756 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,757 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,757 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,757 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,758 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,759 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,760 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,760 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,760 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,760 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,760 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,760 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,760 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,761 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,762 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,763 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 09:36:57,766 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 09:36:57,766 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 09:36:57,771 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 09:36:57,780 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 09:36:57,795 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:36:57,795 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 09:36:57,795 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 09:36:57,795 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 09:36:57,795 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:36:57,795 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:36:57,795 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 09:36:57,795 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:36:57,795 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 09:36:57,802 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141places, 179 transitions [2018-12-08 09:36:58,871 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25103 states. [2018-12-08 09:36:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 25103 states. [2018-12-08 09:36:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 09:36:58,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:36:58,878 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-08 09:36:58,879 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:36:58,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:36:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash -969782754, now seen corresponding path program 1 times [2018-12-08 09:36:58,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:36:58,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:36:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:36:58,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:36:58,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:36:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:36:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:36:59,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:36:59,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:36:59,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:36:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:36:59,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:36:59,028 INFO L87 Difference]: Start difference. First operand 25103 states. Second operand 4 states. [2018-12-08 09:36:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:36:59,403 INFO L93 Difference]: Finished difference Result 45395 states and 177649 transitions. [2018-12-08 09:36:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:36:59,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-12-08 09:36:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:36:59,567 INFO L225 Difference]: With dead ends: 45395 [2018-12-08 09:36:59,567 INFO L226 Difference]: Without dead ends: 40635 [2018-12-08 09:36:59,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:36:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40635 states. [2018-12-08 09:37:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40635 to 23669. [2018-12-08 09:37:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23669 states. [2018-12-08 09:37:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 92566 transitions. [2018-12-08 09:37:00,389 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 92566 transitions. Word has length 32 [2018-12-08 09:37:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:00,389 INFO L480 AbstractCegarLoop]: Abstraction has 23669 states and 92566 transitions. [2018-12-08 09:37:00,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:37:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 92566 transitions. [2018-12-08 09:37:00,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 09:37:00,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:00,392 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-08 09:37:00,392 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:00,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:00,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1661840205, now seen corresponding path program 1 times [2018-12-08 09:37:00,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:00,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:00,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:00,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:00,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:00,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-08 09:37:00,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:00,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:37:00,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:37:00,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:37:00,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:37:00,449 INFO L87 Difference]: Start difference. First operand 23669 states and 92566 transitions. Second operand 5 states. [2018-12-08 09:37:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:01,156 INFO L93 Difference]: Finished difference Result 64837 states and 241396 transitions. [2018-12-08 09:37:01,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:37:01,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-12-08 09:37:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:01,285 INFO L225 Difference]: With dead ends: 64837 [2018-12-08 09:37:01,285 INFO L226 Difference]: Without dead ends: 64677 [2018-12-08 09:37:01,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:37:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64677 states. [2018-12-08 09:37:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64677 to 37149. [2018-12-08 09:37:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37149 states. [2018-12-08 09:37:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37149 states to 37149 states and 138311 transitions. [2018-12-08 09:37:02,202 INFO L78 Accepts]: Start accepts. Automaton has 37149 states and 138311 transitions. Word has length 43 [2018-12-08 09:37:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:02,203 INFO L480 AbstractCegarLoop]: Abstraction has 37149 states and 138311 transitions. [2018-12-08 09:37:02,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:37:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 37149 states and 138311 transitions. [2018-12-08 09:37:02,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 09:37:02,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:02,206 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-08 09:37:02,206 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:02,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:02,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1508943518, now seen corresponding path program 1 times [2018-12-08 09:37:02,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:02,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:02,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:02,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:02,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:02,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:02,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:37:02,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:37:02,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:37:02,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:37:02,250 INFO L87 Difference]: Start difference. First operand 37149 states and 138311 transitions. Second operand 4 states. [2018-12-08 09:37:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:02,321 INFO L93 Difference]: Finished difference Result 12371 states and 41204 transitions. [2018-12-08 09:37:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:37:02,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-08 09:37:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:02,341 INFO L225 Difference]: With dead ends: 12371 [2018-12-08 09:37:02,342 INFO L226 Difference]: Without dead ends: 11850 [2018-12-08 09:37:02,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:37:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11850 states. [2018-12-08 09:37:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11850 to 11850. [2018-12-08 09:37:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11850 states. [2018-12-08 09:37:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11850 states to 11850 states and 39649 transitions. [2018-12-08 09:37:02,513 INFO L78 Accepts]: Start accepts. Automaton has 11850 states and 39649 transitions. Word has length 44 [2018-12-08 09:37:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:02,513 INFO L480 AbstractCegarLoop]: Abstraction has 11850 states and 39649 transitions. [2018-12-08 09:37:02,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:37:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 11850 states and 39649 transitions. [2018-12-08 09:37:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 09:37:02,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:02,519 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-08 09:37:02,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:02,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1699267050, now seen corresponding path program 1 times [2018-12-08 09:37:02,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:02,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:02,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:02,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:02,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:02,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:02,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:37:02,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:37:02,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:37:02,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:37:02,593 INFO L87 Difference]: Start difference. First operand 11850 states and 39649 transitions. Second operand 4 states. [2018-12-08 09:37:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:02,790 INFO L93 Difference]: Finished difference Result 17026 states and 55724 transitions. [2018-12-08 09:37:02,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:37:02,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-08 09:37:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:02,816 INFO L225 Difference]: With dead ends: 17026 [2018-12-08 09:37:02,816 INFO L226 Difference]: Without dead ends: 17026 [2018-12-08 09:37:02,816 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-08 09:37:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17026 states. [2018-12-08 09:37:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17026 to 12886. [2018-12-08 09:37:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12886 states. [2018-12-08 09:37:03,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 42751 transitions. [2018-12-08 09:37:03,029 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 42751 transitions. Word has length 57 [2018-12-08 09:37:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:03,030 INFO L480 AbstractCegarLoop]: Abstraction has 12886 states and 42751 transitions. [2018-12-08 09:37:03,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:37:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 42751 transitions. [2018-12-08 09:37:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 09:37:03,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:03,034 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-08 09:37:03,034 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:03,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:03,035 INFO L82 PathProgramCache]: Analyzing trace with hash -852889911, now seen corresponding path program 1 times [2018-12-08 09:37:03,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:03,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:03,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:03,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:03,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:03,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:03,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:03,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:37:03,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:37:03,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:37:03,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:37:03,085 INFO L87 Difference]: Start difference. First operand 12886 states and 42751 transitions. Second operand 4 states. [2018-12-08 09:37:03,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:03,622 INFO L93 Difference]: Finished difference Result 18381 states and 60008 transitions. [2018-12-08 09:37:03,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:37:03,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-08 09:37:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:03,644 INFO L225 Difference]: With dead ends: 18381 [2018-12-08 09:37:03,644 INFO L226 Difference]: Without dead ends: 18381 [2018-12-08 09:37:03,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:37:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18381 states. [2018-12-08 09:37:03,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18381 to 16342. [2018-12-08 09:37:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16342 states. [2018-12-08 09:37:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 53833 transitions. [2018-12-08 09:37:03,838 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 53833 transitions. Word has length 57 [2018-12-08 09:37:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:03,839 INFO L480 AbstractCegarLoop]: Abstraction has 16342 states and 53833 transitions. [2018-12-08 09:37:03,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:37:03,839 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 53833 transitions. [2018-12-08 09:37:03,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 09:37:03,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:03,845 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-08 09:37:03,845 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:03,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash 500419786, now seen corresponding path program 1 times [2018-12-08 09:37:03,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:03,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:03,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:03,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:03,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:03,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:03,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:37:03,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:37:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:37:03,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:37:03,933 INFO L87 Difference]: Start difference. First operand 16342 states and 53833 transitions. Second operand 6 states. [2018-12-08 09:37:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:04,194 INFO L93 Difference]: Finished difference Result 24888 states and 80174 transitions. [2018-12-08 09:37:04,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:37:04,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2018-12-08 09:37:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:04,227 INFO L225 Difference]: With dead ends: 24888 [2018-12-08 09:37:04,227 INFO L226 Difference]: Without dead ends: 24888 [2018-12-08 09:37:04,227 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-08 09:37:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24888 states. [2018-12-08 09:37:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24888 to 16252. [2018-12-08 09:37:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16252 states. [2018-12-08 09:37:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16252 states to 16252 states and 52196 transitions. [2018-12-08 09:37:04,472 INFO L78 Accepts]: Start accepts. Automaton has 16252 states and 52196 transitions. Word has length 57 [2018-12-08 09:37:04,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:04,472 INFO L480 AbstractCegarLoop]: Abstraction has 16252 states and 52196 transitions. [2018-12-08 09:37:04,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:37:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 16252 states and 52196 transitions. [2018-12-08 09:37:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 09:37:04,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:04,476 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-08 09:37:04,476 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:04,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:04,476 INFO L82 PathProgramCache]: Analyzing trace with hash 207016779, now seen corresponding path program 1 times [2018-12-08 09:37:04,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:04,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:04,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:04,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:04,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:04,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:37:04,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:37:04,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:37:04,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:37:04,539 INFO L87 Difference]: Start difference. First operand 16252 states and 52196 transitions. Second operand 5 states. [2018-12-08 09:37:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:04,570 INFO L93 Difference]: Finished difference Result 2696 states and 7013 transitions. [2018-12-08 09:37:04,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 09:37:04,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-08 09:37:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:04,573 INFO L225 Difference]: With dead ends: 2696 [2018-12-08 09:37:04,573 INFO L226 Difference]: Without dead ends: 2224 [2018-12-08 09:37:04,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:37:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2018-12-08 09:37:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 2150. [2018-12-08 09:37:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2150 states. [2018-12-08 09:37:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 5587 transitions. [2018-12-08 09:37:04,593 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 5587 transitions. Word has length 57 [2018-12-08 09:37:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:04,593 INFO L480 AbstractCegarLoop]: Abstraction has 2150 states and 5587 transitions. [2018-12-08 09:37:04,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:37:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 5587 transitions. [2018-12-08 09:37:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 09:37:04,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:04,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:37:04,595 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:04,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:04,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2072438205, now seen corresponding path program 1 times [2018-12-08 09:37:04,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:04,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:04,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:04,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:04,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:04,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:04,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:37:04,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:37:04,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:37:04,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:37:04,635 INFO L87 Difference]: Start difference. First operand 2150 states and 5587 transitions. Second operand 4 states. [2018-12-08 09:37:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:04,728 INFO L93 Difference]: Finished difference Result 3137 states and 7854 transitions. [2018-12-08 09:37:04,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:37:04,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-08 09:37:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:04,731 INFO L225 Difference]: With dead ends: 3137 [2018-12-08 09:37:04,731 INFO L226 Difference]: Without dead ends: 3137 [2018-12-08 09:37:04,731 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-08 09:37:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3137 states. [2018-12-08 09:37:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3137 to 2234. [2018-12-08 09:37:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2234 states. [2018-12-08 09:37:04,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 5761 transitions. [2018-12-08 09:37:04,752 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 5761 transitions. Word has length 92 [2018-12-08 09:37:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:04,753 INFO L480 AbstractCegarLoop]: Abstraction has 2234 states and 5761 transitions. [2018-12-08 09:37:04,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:37:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 5761 transitions. [2018-12-08 09:37:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 09:37:04,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:04,755 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-08 09:37:04,755 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:04,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash 889090908, now seen corresponding path program 1 times [2018-12-08 09:37:04,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:04,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:04,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:04,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:04,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:04,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:37:04,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:37:04,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:37:04,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:37:04,841 INFO L87 Difference]: Start difference. First operand 2234 states and 5761 transitions. Second operand 6 states. [2018-12-08 09:37:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:04,968 INFO L93 Difference]: Finished difference Result 2513 states and 6342 transitions. [2018-12-08 09:37:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:37:04,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-08 09:37:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:04,970 INFO L225 Difference]: With dead ends: 2513 [2018-12-08 09:37:04,970 INFO L226 Difference]: Without dead ends: 2513 [2018-12-08 09:37:04,970 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-08 09:37:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2018-12-08 09:37:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2048. [2018-12-08 09:37:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2018-12-08 09:37:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 5299 transitions. [2018-12-08 09:37:04,986 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 5299 transitions. Word has length 92 [2018-12-08 09:37:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:04,986 INFO L480 AbstractCegarLoop]: Abstraction has 2048 states and 5299 transitions. [2018-12-08 09:37:04,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:37:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 5299 transitions. [2018-12-08 09:37:04,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 09:37:04,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:04,988 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-08 09:37:04,988 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:04,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:04,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1759073572, now seen corresponding path program 1 times [2018-12-08 09:37:04,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:04,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:04,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:04,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:04,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:05,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:05,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:37:05,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:37:05,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:37:05,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:37:05,080 INFO L87 Difference]: Start difference. First operand 2048 states and 5299 transitions. Second operand 6 states. [2018-12-08 09:37:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:05,252 INFO L93 Difference]: Finished difference Result 2241 states and 5642 transitions. [2018-12-08 09:37:05,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:37:05,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-08 09:37:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:05,254 INFO L225 Difference]: With dead ends: 2241 [2018-12-08 09:37:05,254 INFO L226 Difference]: Without dead ends: 2241 [2018-12-08 09:37:05,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 09:37:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2018-12-08 09:37:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2072. [2018-12-08 09:37:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-12-08 09:37:05,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 5304 transitions. [2018-12-08 09:37:05,268 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 5304 transitions. Word has length 92 [2018-12-08 09:37:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:05,268 INFO L480 AbstractCegarLoop]: Abstraction has 2072 states and 5304 transitions. [2018-12-08 09:37:05,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:37:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 5304 transitions. [2018-12-08 09:37:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 09:37:05,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:05,270 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-08 09:37:05,270 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:05,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:05,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1511199803, now seen corresponding path program 1 times [2018-12-08 09:37:05,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:05,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:05,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:05,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:05,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:05,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:05,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:37:05,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:37:05,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:37:05,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:37:05,344 INFO L87 Difference]: Start difference. First operand 2072 states and 5304 transitions. Second operand 5 states. [2018-12-08 09:37:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:05,465 INFO L93 Difference]: Finished difference Result 2853 states and 7060 transitions. [2018-12-08 09:37:05,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:37:05,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-08 09:37:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:05,468 INFO L225 Difference]: With dead ends: 2853 [2018-12-08 09:37:05,468 INFO L226 Difference]: Without dead ends: 2853 [2018-12-08 09:37:05,469 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-08 09:37:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2018-12-08 09:37:05,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2244. [2018-12-08 09:37:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2018-12-08 09:37:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 5654 transitions. [2018-12-08 09:37:05,495 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 5654 transitions. Word has length 92 [2018-12-08 09:37:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:05,495 INFO L480 AbstractCegarLoop]: Abstraction has 2244 states and 5654 transitions. [2018-12-08 09:37:05,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:37:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 5654 transitions. [2018-12-08 09:37:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 09:37:05,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:05,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:37:05,498 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:05,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1438573394, now seen corresponding path program 2 times [2018-12-08 09:37:05,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:05,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:05,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:05,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:05,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:05,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:05,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 09:37:05,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 09:37:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 09:37:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 09:37:05,539 INFO L87 Difference]: Start difference. First operand 2244 states and 5654 transitions. Second operand 4 states. [2018-12-08 09:37:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:05,614 INFO L93 Difference]: Finished difference Result 2580 states and 6574 transitions. [2018-12-08 09:37:05,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 09:37:05,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-08 09:37:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:05,618 INFO L225 Difference]: With dead ends: 2580 [2018-12-08 09:37:05,618 INFO L226 Difference]: Without dead ends: 2580 [2018-12-08 09:37:05,618 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-08 09:37:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2018-12-08 09:37:05,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2548. [2018-12-08 09:37:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2018-12-08 09:37:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 6494 transitions. [2018-12-08 09:37:05,643 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 6494 transitions. Word has length 92 [2018-12-08 09:37:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:05,643 INFO L480 AbstractCegarLoop]: Abstraction has 2548 states and 6494 transitions. [2018-12-08 09:37:05,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 09:37:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 6494 transitions. [2018-12-08 09:37:05,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 09:37:05,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:05,645 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-08 09:37:05,645 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:05,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:05,646 INFO L82 PathProgramCache]: Analyzing trace with hash -638635949, now seen corresponding path program 1 times [2018-12-08 09:37:05,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:05,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:05,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:05,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:37:05,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:05,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:05,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 09:37:05,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 09:37:05,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 09:37:05,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:37:05,735 INFO L87 Difference]: Start difference. First operand 2548 states and 6494 transitions. Second operand 8 states. [2018-12-08 09:37:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:05,997 INFO L93 Difference]: Finished difference Result 3957 states and 10028 transitions. [2018-12-08 09:37:05,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 09:37:05,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-12-08 09:37:05,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:06,002 INFO L225 Difference]: With dead ends: 3957 [2018-12-08 09:37:06,002 INFO L226 Difference]: Without dead ends: 3925 [2018-12-08 09:37:06,003 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-08 09:37:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2018-12-08 09:37:06,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3392. [2018-12-08 09:37:06,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3392 states. [2018-12-08 09:37:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 8645 transitions. [2018-12-08 09:37:06,042 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 8645 transitions. Word has length 92 [2018-12-08 09:37:06,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:06,042 INFO L480 AbstractCegarLoop]: Abstraction has 3392 states and 8645 transitions. [2018-12-08 09:37:06,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 09:37:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 8645 transitions. [2018-12-08 09:37:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 09:37:06,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:06,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:37:06,045 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:06,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:06,045 INFO L82 PathProgramCache]: Analyzing trace with hash 322978068, now seen corresponding path program 1 times [2018-12-08 09:37:06,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:06,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:06,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:06,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:06,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:06,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:06,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:37:06,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:37:06,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:37:06,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:37:06,118 INFO L87 Difference]: Start difference. First operand 3392 states and 8645 transitions. Second operand 7 states. [2018-12-08 09:37:06,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:06,339 INFO L93 Difference]: Finished difference Result 4456 states and 11306 transitions. [2018-12-08 09:37:06,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:37:06,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-12-08 09:37:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:06,343 INFO L225 Difference]: With dead ends: 4456 [2018-12-08 09:37:06,343 INFO L226 Difference]: Without dead ends: 4456 [2018-12-08 09:37:06,344 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-08 09:37:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2018-12-08 09:37:06,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 3856. [2018-12-08 09:37:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3856 states. [2018-12-08 09:37:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 9887 transitions. [2018-12-08 09:37:06,373 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 9887 transitions. Word has length 92 [2018-12-08 09:37:06,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:06,374 INFO L480 AbstractCegarLoop]: Abstraction has 3856 states and 9887 transitions. [2018-12-08 09:37:06,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:37:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 9887 transitions. [2018-12-08 09:37:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 09:37:06,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:06,377 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-08 09:37:06,377 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:06,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1567742549, now seen corresponding path program 1 times [2018-12-08 09:37:06,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:06,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:06,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:06,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:06,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:06,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:37:06,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:37:06,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:37:06,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:37:06,449 INFO L87 Difference]: Start difference. First operand 3856 states and 9887 transitions. Second operand 5 states. [2018-12-08 09:37:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:06,475 INFO L93 Difference]: Finished difference Result 5688 states and 14819 transitions. [2018-12-08 09:37:06,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:37:06,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-12-08 09:37:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:06,480 INFO L225 Difference]: With dead ends: 5688 [2018-12-08 09:37:06,480 INFO L226 Difference]: Without dead ends: 5688 [2018-12-08 09:37:06,480 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-08 09:37:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2018-12-08 09:37:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 3422. [2018-12-08 09:37:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3422 states. [2018-12-08 09:37:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 8725 transitions. [2018-12-08 09:37:06,516 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 8725 transitions. Word has length 92 [2018-12-08 09:37:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:06,516 INFO L480 AbstractCegarLoop]: Abstraction has 3422 states and 8725 transitions. [2018-12-08 09:37:06,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:37:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 8725 transitions. [2018-12-08 09:37:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-08 09:37:06,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:06,519 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-08 09:37:06,519 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:06,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:06,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2048458965, now seen corresponding path program 1 times [2018-12-08 09:37:06,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:06,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:06,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:06,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:06,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:06,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:37:06,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:37:06,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:37:06,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:37:06,566 INFO L87 Difference]: Start difference. First operand 3422 states and 8725 transitions. Second operand 6 states. [2018-12-08 09:37:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:06,677 INFO L93 Difference]: Finished difference Result 2862 states and 7069 transitions. [2018-12-08 09:37:06,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:37:06,677 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2018-12-08 09:37:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:06,679 INFO L225 Difference]: With dead ends: 2862 [2018-12-08 09:37:06,679 INFO L226 Difference]: Without dead ends: 2862 [2018-12-08 09:37:06,679 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-08 09:37:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2018-12-08 09:37:06,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2067. [2018-12-08 09:37:06,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2018-12-08 09:37:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 5267 transitions. [2018-12-08 09:37:06,697 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 5267 transitions. Word has length 92 [2018-12-08 09:37:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:06,697 INFO L480 AbstractCegarLoop]: Abstraction has 2067 states and 5267 transitions. [2018-12-08 09:37:06,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:37:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 5267 transitions. [2018-12-08 09:37:06,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 09:37:06,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:06,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:37:06,699 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:06,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:06,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1613356635, now seen corresponding path program 1 times [2018-12-08 09:37:06,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:06,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:06,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:06,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:06,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:06,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:37:06,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 09:37:06,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:37:06,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:37:06,745 INFO L87 Difference]: Start difference. First operand 2067 states and 5267 transitions. Second operand 5 states. [2018-12-08 09:37:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:06,850 INFO L93 Difference]: Finished difference Result 2387 states and 6067 transitions. [2018-12-08 09:37:06,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:37:06,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-08 09:37:06,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:06,852 INFO L225 Difference]: With dead ends: 2387 [2018-12-08 09:37:06,852 INFO L226 Difference]: Without dead ends: 2387 [2018-12-08 09:37:06,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:37:06,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2018-12-08 09:37:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2115. [2018-12-08 09:37:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-12-08 09:37:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 5387 transitions. [2018-12-08 09:37:06,868 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 5387 transitions. Word has length 94 [2018-12-08 09:37:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:06,868 INFO L480 AbstractCegarLoop]: Abstraction has 2115 states and 5387 transitions. [2018-12-08 09:37:06,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 09:37:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 5387 transitions. [2018-12-08 09:37:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 09:37:06,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:06,870 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-08 09:37:06,870 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:06,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:06,870 INFO L82 PathProgramCache]: Analyzing trace with hash -368592154, now seen corresponding path program 1 times [2018-12-08 09:37:06,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:06,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:06,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:06,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:06,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:37:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:37:06,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:37:06,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 09:37:06,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 09:37:06,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 09:37:06,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-08 09:37:06,989 INFO L87 Difference]: Start difference. First operand 2115 states and 5387 transitions. Second operand 12 states. [2018-12-08 09:37:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:37:07,396 INFO L93 Difference]: Finished difference Result 3902 states and 10089 transitions. [2018-12-08 09:37:07,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 09:37:07,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-08 09:37:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:37:07,399 INFO L225 Difference]: With dead ends: 3902 [2018-12-08 09:37:07,399 INFO L226 Difference]: Without dead ends: 2926 [2018-12-08 09:37:07,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-08 09:37:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2926 states. [2018-12-08 09:37:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2926 to 2646. [2018-12-08 09:37:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2646 states. [2018-12-08 09:37:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2646 states to 2646 states and 6640 transitions. [2018-12-08 09:37:07,420 INFO L78 Accepts]: Start accepts. Automaton has 2646 states and 6640 transitions. Word has length 94 [2018-12-08 09:37:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:37:07,421 INFO L480 AbstractCegarLoop]: Abstraction has 2646 states and 6640 transitions. [2018-12-08 09:37:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 09:37:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2646 states and 6640 transitions. [2018-12-08 09:37:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-08 09:37:07,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:37:07,423 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-08 09:37:07,423 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:37:07,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:37:07,423 INFO L82 PathProgramCache]: Analyzing trace with hash -822908468, now seen corresponding path program 2 times [2018-12-08 09:37:07,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:37:07,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:37:07,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:07,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:37:07,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:37:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:37:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:37:07,464 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 09:37:07,524 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 09:37:07,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 09:37:07 BasicIcfg [2018-12-08 09:37:07,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 09:37:07,526 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:37:07,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:37:07,526 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:37:07,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:36:57" (3/4) ... [2018-12-08 09:37:07,528 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 09:37:07,597 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c0b1d1ea-a45b-48f1-ab34-95e301ee85e0/bin-2019/uautomizer/witness.graphml [2018-12-08 09:37:07,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:37:07,598 INFO L168 Benchmark]: Toolchain (without parser) took 10623.30 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -117.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-08 09:37:07,599 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:37:07,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:37:07,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.48 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:37:07,600 INFO L168 Benchmark]: Boogie Preprocessor took 19.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:37:07,600 INFO L168 Benchmark]: RCFGBuilder took 330.23 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2018-12-08 09:37:07,600 INFO L168 Benchmark]: TraceAbstraction took 9794.28 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -55.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-08 09:37:07,600 INFO L168 Benchmark]: Witness Printer took 71.86 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-12-08 09:37:07,601 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -142.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.48 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 330.23 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: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9794.28 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -55.8 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 71.86 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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 t2015; 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(&t2015, ((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 t2016; 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(&t2016, ((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, 9.7s OverallTime, 19 OverallIterations, 1 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4250 SDtfs, 3875 SDslu, 10039 SDs, 0 SdLazy, 3412 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s 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.8s 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...