/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:06:16,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:06:16,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:06:16,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:06:16,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:06:16,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:06:16,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:06:17,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:06:17,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:06:17,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:06:17,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:06:17,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:06:17,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:06:17,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:06:17,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:06:17,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:06:17,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:06:17,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:06:17,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:06:17,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:06:17,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:06:17,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:06:17,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:06:17,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:06:17,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:06:17,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:06:17,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:06:17,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:06:17,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:06:17,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:06:17,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:06:17,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:06:17,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:06:17,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:06:17,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:06:17,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:06:17,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:06:17,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:06:17,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:06:17,084 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:06:17,085 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:06:17,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 07:06:17,142 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:06:17,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:06:17,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:06:17,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:06:17,147 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:06:17,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:06:17,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:06:17,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:06:17,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:06:17,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:06:17,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:06:17,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:06:17,150 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:06:17,150 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:06:17,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:06:17,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:06:17,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:06:17,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:06:17,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:06:17,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:06:17,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:06:17,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:06:17,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:06:17,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:06:17,153 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:06:17,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 07:06:17,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:06:17,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:06:17,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:06:17,635 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:06:17,636 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:06:17,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-12-22 07:06:17,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b5e3569/22ab25cac6d949bca64c03442032a3ab/FLAG7d37cf2c1 [2020-12-22 07:06:18,348 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:06:18,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-12-22 07:06:18,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b5e3569/22ab25cac6d949bca64c03442032a3ab/FLAG7d37cf2c1 [2020-12-22 07:06:18,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b5e3569/22ab25cac6d949bca64c03442032a3ab [2020-12-22 07:06:18,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:06:18,733 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:06:18,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:06:18,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:06:18,744 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:06:18,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:06:18" (1/1) ... [2020-12-22 07:06:18,748 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@543d8ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:18, skipping insertion in model container [2020-12-22 07:06:18,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:06:18" (1/1) ... [2020-12-22 07:06:18,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:06:18,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:06:18,980 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2020-12-22 07:06:19,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:06:19,057 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:06:19,080 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2020-12-22 07:06:19,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:06:19,174 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:06:19,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19 WrapperNode [2020-12-22 07:06:19,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:06:19,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:06:19,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:06:19,178 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:06:19,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (1/1) ... [2020-12-22 07:06:19,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (1/1) ... [2020-12-22 07:06:19,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:06:19,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:06:19,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:06:19,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:06:19,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (1/1) ... [2020-12-22 07:06:19,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (1/1) ... [2020-12-22 07:06:19,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (1/1) ... [2020-12-22 07:06:19,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (1/1) ... [2020-12-22 07:06:19,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (1/1) ... [2020-12-22 07:06:19,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (1/1) ... [2020-12-22 07:06:19,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (1/1) ... [2020-12-22 07:06:19,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:06:19,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:06:19,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:06:19,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:06:19,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-12-22 07:06:19,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:06:19,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:06:19,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:06:19,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:06:20,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:06:20,212 INFO L299 CfgBuilder]: Removed 42 assume(true) statements. [2020-12-22 07:06:20,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:06:20 BoogieIcfgContainer [2020-12-22 07:06:20,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:06:20,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:06:20,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:06:20,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:06:20,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:06:18" (1/3) ... [2020-12-22 07:06:20,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268735a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:06:20, skipping insertion in model container [2020-12-22 07:06:20,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:06:19" (2/3) ... [2020-12-22 07:06:20,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268735a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:06:20, skipping insertion in model container [2020-12-22 07:06:20,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:06:20" (3/3) ... [2020-12-22 07:06:20,223 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-12-22 07:06:20,230 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:06:20,235 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 07:06:20,254 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-22 07:06:20,279 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:06:20,279 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:06:20,280 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:06:20,280 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:06:20,280 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:06:20,280 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:06:20,286 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:06:20,286 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:06:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2020-12-22 07:06:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-22 07:06:20,311 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:20,312 INFO L422 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] [2020-12-22 07:06:20,312 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:20,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:20,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2020-12-22 07:06:20,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:20,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885214211] [2020-12-22 07:06:20,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:20,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:20,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885214211] [2020-12-22 07:06:20,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:20,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:20,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758682160] [2020-12-22 07:06:20,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:20,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:20,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:20,580 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2020-12-22 07:06:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:20,669 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2020-12-22 07:06:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:20,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-12-22 07:06:20,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:20,684 INFO L225 Difference]: With dead ends: 214 [2020-12-22 07:06:20,684 INFO L226 Difference]: Without dead ends: 135 [2020-12-22 07:06:20,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:20,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-12-22 07:06:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2020-12-22 07:06:20,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-22 07:06:20,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2020-12-22 07:06:20,739 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2020-12-22 07:06:20,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:20,739 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2020-12-22 07:06:20,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2020-12-22 07:06:20,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:06:20,742 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:20,742 INFO L422 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] [2020-12-22 07:06:20,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:06:20,742 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:20,743 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2020-12-22 07:06:20,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:20,744 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691907993] [2020-12-22 07:06:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:20,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691907993] [2020-12-22 07:06:20,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:20,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:20,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545686930] [2020-12-22 07:06:20,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:20,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:20,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:20,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:20,820 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2020-12-22 07:06:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:20,912 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2020-12-22 07:06:20,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:20,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-22 07:06:20,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:20,916 INFO L225 Difference]: With dead ends: 323 [2020-12-22 07:06:20,916 INFO L226 Difference]: Without dead ends: 215 [2020-12-22 07:06:20,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-12-22 07:06:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2020-12-22 07:06:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-12-22 07:06:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2020-12-22 07:06:20,949 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2020-12-22 07:06:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:20,950 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2020-12-22 07:06:20,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2020-12-22 07:06:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-12-22 07:06:20,953 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:20,953 INFO L422 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] [2020-12-22 07:06:20,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:06:20,953 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:20,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:20,954 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2020-12-22 07:06:20,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:20,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003741374] [2020-12-22 07:06:20,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:21,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003741374] [2020-12-22 07:06:21,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:21,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:21,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467713629] [2020-12-22 07:06:21,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:21,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:21,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:21,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:21,026 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2020-12-22 07:06:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:21,077 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2020-12-22 07:06:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:21,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-12-22 07:06:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:21,081 INFO L225 Difference]: With dead ends: 526 [2020-12-22 07:06:21,081 INFO L226 Difference]: Without dead ends: 321 [2020-12-22 07:06:21,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:21,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-12-22 07:06:21,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2020-12-22 07:06:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-12-22 07:06:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2020-12-22 07:06:21,121 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2020-12-22 07:06:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:21,122 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2020-12-22 07:06:21,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2020-12-22 07:06:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-22 07:06:21,126 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:21,126 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:21,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 07:06:21,127 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:21,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:21,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2020-12-22 07:06:21,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:21,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880131672] [2020-12-22 07:06:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:21,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880131672] [2020-12-22 07:06:21,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:21,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:21,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621108798] [2020-12-22 07:06:21,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:21,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:21,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:21,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:21,221 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2020-12-22 07:06:21,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:21,284 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2020-12-22 07:06:21,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:21,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-22 07:06:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:21,288 INFO L225 Difference]: With dead ends: 740 [2020-12-22 07:06:21,289 INFO L226 Difference]: Without dead ends: 449 [2020-12-22 07:06:21,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2020-12-22 07:06:21,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2020-12-22 07:06:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-12-22 07:06:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2020-12-22 07:06:21,349 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2020-12-22 07:06:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:21,350 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2020-12-22 07:06:21,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2020-12-22 07:06:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-22 07:06:21,355 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:21,355 INFO L422 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] [2020-12-22 07:06:21,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 07:06:21,355 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:21,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2020-12-22 07:06:21,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:21,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382354758] [2020-12-22 07:06:21,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:21,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382354758] [2020-12-22 07:06:21,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:21,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:21,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815254209] [2020-12-22 07:06:21,463 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:21,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:21,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:21,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:21,465 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2020-12-22 07:06:21,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:21,538 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2020-12-22 07:06:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:21,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-22 07:06:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:21,543 INFO L225 Difference]: With dead ends: 914 [2020-12-22 07:06:21,543 INFO L226 Difference]: Without dead ends: 555 [2020-12-22 07:06:21,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-12-22 07:06:21,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2020-12-22 07:06:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-12-22 07:06:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2020-12-22 07:06:21,575 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2020-12-22 07:06:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:21,576 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2020-12-22 07:06:21,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2020-12-22 07:06:21,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-22 07:06:21,579 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:21,579 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:21,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 07:06:21,580 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:21,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:21,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2020-12-22 07:06:21,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:21,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116871853] [2020-12-22 07:06:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:21,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116871853] [2020-12-22 07:06:21,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:21,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:06:21,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380266039] [2020-12-22 07:06:21,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:06:21,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:06:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:06:21,658 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 5 states. [2020-12-22 07:06:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:21,783 INFO L93 Difference]: Finished difference Result 1620 states and 2104 transitions. [2020-12-22 07:06:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:06:21,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-12-22 07:06:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:21,791 INFO L225 Difference]: With dead ends: 1620 [2020-12-22 07:06:21,791 INFO L226 Difference]: Without dead ends: 1203 [2020-12-22 07:06:21,793 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:06:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-12-22 07:06:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 579. [2020-12-22 07:06:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2020-12-22 07:06:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 738 transitions. [2020-12-22 07:06:21,834 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 738 transitions. Word has length 53 [2020-12-22 07:06:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:21,835 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 738 transitions. [2020-12-22 07:06:21,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:06:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 738 transitions. [2020-12-22 07:06:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-22 07:06:21,837 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:21,838 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:21,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 07:06:21,838 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:21,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:21,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1443121595, now seen corresponding path program 1 times [2020-12-22 07:06:21,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:21,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216819968] [2020-12-22 07:06:21,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:21,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216819968] [2020-12-22 07:06:21,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:21,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:06:21,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098557962] [2020-12-22 07:06:21,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:06:21,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:06:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:06:21,945 INFO L87 Difference]: Start difference. First operand 579 states and 738 transitions. Second operand 5 states. [2020-12-22 07:06:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:22,087 INFO L93 Difference]: Finished difference Result 1356 states and 1736 transitions. [2020-12-22 07:06:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:06:22,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-12-22 07:06:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:22,094 INFO L225 Difference]: With dead ends: 1356 [2020-12-22 07:06:22,094 INFO L226 Difference]: Without dead ends: 866 [2020-12-22 07:06:22,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 07:06:22,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2020-12-22 07:06:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 480. [2020-12-22 07:06:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-12-22 07:06:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 610 transitions. [2020-12-22 07:06:22,139 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 610 transitions. Word has length 53 [2020-12-22 07:06:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:22,139 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 610 transitions. [2020-12-22 07:06:22,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:06:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 610 transitions. [2020-12-22 07:06:22,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-22 07:06:22,141 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:22,142 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:22,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 07:06:22,142 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:22,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1577075519, now seen corresponding path program 1 times [2020-12-22 07:06:22,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:22,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241757440] [2020-12-22 07:06:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 07:06:22,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241757440] [2020-12-22 07:06:22,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:22,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:22,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459562360] [2020-12-22 07:06:22,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:22,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:22,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:22,214 INFO L87 Difference]: Start difference. First operand 480 states and 610 transitions. Second operand 3 states. [2020-12-22 07:06:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:22,263 INFO L93 Difference]: Finished difference Result 862 states and 1099 transitions. [2020-12-22 07:06:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:22,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-12-22 07:06:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:22,266 INFO L225 Difference]: With dead ends: 862 [2020-12-22 07:06:22,266 INFO L226 Difference]: Without dead ends: 478 [2020-12-22 07:06:22,267 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-12-22 07:06:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 437. [2020-12-22 07:06:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-12-22 07:06:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 544 transitions. [2020-12-22 07:06:22,299 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 544 transitions. Word has length 53 [2020-12-22 07:06:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:22,299 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 544 transitions. [2020-12-22 07:06:22,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 544 transitions. [2020-12-22 07:06:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-22 07:06:22,301 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:22,301 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:22,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:06:22,301 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:22,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash -179687388, now seen corresponding path program 1 times [2020-12-22 07:06:22,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:22,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18126703] [2020-12-22 07:06:22,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:22,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18126703] [2020-12-22 07:06:22,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:22,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:06:22,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622300530] [2020-12-22 07:06:22,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:06:22,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:22,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:06:22,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:06:22,349 INFO L87 Difference]: Start difference. First operand 437 states and 544 transitions. Second operand 4 states. [2020-12-22 07:06:22,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:22,397 INFO L93 Difference]: Finished difference Result 481 states and 596 transitions. [2020-12-22 07:06:22,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:06:22,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-12-22 07:06:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:22,400 INFO L225 Difference]: With dead ends: 481 [2020-12-22 07:06:22,400 INFO L226 Difference]: Without dead ends: 479 [2020-12-22 07:06:22,401 INFO L677 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 [2020-12-22 07:06:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-12-22 07:06:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 435. [2020-12-22 07:06:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-12-22 07:06:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 541 transitions. [2020-12-22 07:06:22,433 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 541 transitions. Word has length 53 [2020-12-22 07:06:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:22,434 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 541 transitions. [2020-12-22 07:06:22,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:06:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 541 transitions. [2020-12-22 07:06:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-22 07:06:22,435 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:22,435 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:22,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 07:06:22,436 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:22,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:22,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1275353301, now seen corresponding path program 1 times [2020-12-22 07:06:22,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:22,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045285212] [2020-12-22 07:06:22,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:22,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045285212] [2020-12-22 07:06:22,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729457767] [2020-12-22 07:06:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:06:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:22,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-22 07:06:22,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:06:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:22,986 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:06:22,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-12-22 07:06:22,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272904933] [2020-12-22 07:06:22,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 07:06:22,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:22,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 07:06:22,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:06:22,991 INFO L87 Difference]: Start difference. First operand 435 states and 541 transitions. Second operand 6 states. [2020-12-22 07:06:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:23,119 INFO L93 Difference]: Finished difference Result 781 states and 968 transitions. [2020-12-22 07:06:23,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 07:06:23,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-12-22 07:06:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:23,125 INFO L225 Difference]: With dead ends: 781 [2020-12-22 07:06:23,125 INFO L226 Difference]: Without dead ends: 779 [2020-12-22 07:06:23,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 07:06:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-12-22 07:06:23,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 633. [2020-12-22 07:06:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-12-22 07:06:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 794 transitions. [2020-12-22 07:06:23,187 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 794 transitions. Word has length 54 [2020-12-22 07:06:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:23,188 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 794 transitions. [2020-12-22 07:06:23,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 07:06:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 794 transitions. [2020-12-22 07:06:23,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-12-22 07:06:23,190 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:23,190 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:23,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-22 07:06:23,404 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:23,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:23,405 INFO L82 PathProgramCache]: Analyzing trace with hash 602571322, now seen corresponding path program 2 times [2020-12-22 07:06:23,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:23,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803926941] [2020-12-22 07:06:23,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:06:23,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803926941] [2020-12-22 07:06:23,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:23,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:23,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715500615] [2020-12-22 07:06:23,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:23,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:23,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:23,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:23,443 INFO L87 Difference]: Start difference. First operand 633 states and 794 transitions. Second operand 3 states. [2020-12-22 07:06:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:23,515 INFO L93 Difference]: Finished difference Result 966 states and 1210 transitions. [2020-12-22 07:06:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:23,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-12-22 07:06:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:23,519 INFO L225 Difference]: With dead ends: 966 [2020-12-22 07:06:23,519 INFO L226 Difference]: Without dead ends: 629 [2020-12-22 07:06:23,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-12-22 07:06:23,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2020-12-22 07:06:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-12-22 07:06:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 719 transitions. [2020-12-22 07:06:23,596 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 719 transitions. Word has length 69 [2020-12-22 07:06:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:23,596 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 719 transitions. [2020-12-22 07:06:23,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:23,597 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 719 transitions. [2020-12-22 07:06:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-12-22 07:06:23,604 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:23,605 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:23,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 07:06:23,605 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:23,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:23,606 INFO L82 PathProgramCache]: Analyzing trace with hash -630281229, now seen corresponding path program 1 times [2020-12-22 07:06:23,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:23,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879380773] [2020-12-22 07:06:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 07:06:23,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879380773] [2020-12-22 07:06:23,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:23,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:23,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458871762] [2020-12-22 07:06:23,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:23,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:23,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:23,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:23,665 INFO L87 Difference]: Start difference. First operand 580 states and 719 transitions. Second operand 3 states. [2020-12-22 07:06:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:23,748 INFO L93 Difference]: Finished difference Result 1172 states and 1450 transitions. [2020-12-22 07:06:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:23,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-12-22 07:06:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:23,752 INFO L225 Difference]: With dead ends: 1172 [2020-12-22 07:06:23,752 INFO L226 Difference]: Without dead ends: 598 [2020-12-22 07:06:23,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-12-22 07:06:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 580. [2020-12-22 07:06:23,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-12-22 07:06:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 699 transitions. [2020-12-22 07:06:23,807 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 699 transitions. Word has length 80 [2020-12-22 07:06:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:23,808 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 699 transitions. [2020-12-22 07:06:23,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 699 transitions. [2020-12-22 07:06:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-22 07:06:23,809 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:23,810 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:23,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 07:06:23,810 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1099928721, now seen corresponding path program 1 times [2020-12-22 07:06:23,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:23,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478768818] [2020-12-22 07:06:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 07:06:23,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478768818] [2020-12-22 07:06:23,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:23,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:23,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225414813] [2020-12-22 07:06:23,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:23,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:23,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:23,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:23,872 INFO L87 Difference]: Start difference. First operand 580 states and 699 transitions. Second operand 3 states. [2020-12-22 07:06:23,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:23,933 INFO L93 Difference]: Finished difference Result 911 states and 1095 transitions. [2020-12-22 07:06:23,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:23,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-12-22 07:06:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:23,939 INFO L225 Difference]: With dead ends: 911 [2020-12-22 07:06:23,939 INFO L226 Difference]: Without dead ends: 284 [2020-12-22 07:06:23,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-12-22 07:06:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2020-12-22 07:06:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-22 07:06:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 320 transitions. [2020-12-22 07:06:23,965 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 320 transitions. Word has length 81 [2020-12-22 07:06:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:23,966 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 320 transitions. [2020-12-22 07:06:23,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:23,966 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 320 transitions. [2020-12-22 07:06:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-22 07:06:23,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:23,967 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:23,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 07:06:23,968 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:23,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1534139577, now seen corresponding path program 1 times [2020-12-22 07:06:23,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:23,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293423898] [2020-12-22 07:06:23,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 07:06:24,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293423898] [2020-12-22 07:06:24,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:24,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:24,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364434207] [2020-12-22 07:06:24,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:24,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:24,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:24,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:24,027 INFO L87 Difference]: Start difference. First operand 282 states and 320 transitions. Second operand 3 states. [2020-12-22 07:06:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:24,091 INFO L93 Difference]: Finished difference Result 401 states and 458 transitions. [2020-12-22 07:06:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:24,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-22 07:06:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:24,093 INFO L225 Difference]: With dead ends: 401 [2020-12-22 07:06:24,094 INFO L226 Difference]: Without dead ends: 279 [2020-12-22 07:06:24,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-12-22 07:06:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2020-12-22 07:06:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-12-22 07:06:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 315 transitions. [2020-12-22 07:06:24,123 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 315 transitions. Word has length 101 [2020-12-22 07:06:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:24,123 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 315 transitions. [2020-12-22 07:06:24,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:24,124 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 315 transitions. [2020-12-22 07:06:24,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-22 07:06:24,125 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:24,125 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:24,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 07:06:24,126 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:24,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:24,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1342369766, now seen corresponding path program 1 times [2020-12-22 07:06:24,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:24,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119913577] [2020-12-22 07:06:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-22 07:06:24,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119913577] [2020-12-22 07:06:24,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:24,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:06:24,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511613806] [2020-12-22 07:06:24,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:06:24,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:24,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:06:24,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:06:24,228 INFO L87 Difference]: Start difference. First operand 279 states and 315 transitions. Second operand 4 states. [2020-12-22 07:06:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:24,277 INFO L93 Difference]: Finished difference Result 395 states and 447 transitions. [2020-12-22 07:06:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:06:24,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-22 07:06:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:24,279 INFO L225 Difference]: With dead ends: 395 [2020-12-22 07:06:24,279 INFO L226 Difference]: Without dead ends: 270 [2020-12-22 07:06:24,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:06:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-12-22 07:06:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2020-12-22 07:06:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-12-22 07:06:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2020-12-22 07:06:24,305 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 102 [2020-12-22 07:06:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:24,305 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2020-12-22 07:06:24,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:06:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2020-12-22 07:06:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-22 07:06:24,307 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:24,307 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:24,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 07:06:24,307 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:24,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:24,308 INFO L82 PathProgramCache]: Analyzing trace with hash 759125341, now seen corresponding path program 1 times [2020-12-22 07:06:24,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:24,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145864696] [2020-12-22 07:06:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 07:06:24,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145864696] [2020-12-22 07:06:24,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:24,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 07:06:24,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993824102] [2020-12-22 07:06:24,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 07:06:24,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:24,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 07:06:24,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:24,366 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand 3 states. [2020-12-22 07:06:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:24,412 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2020-12-22 07:06:24,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 07:06:24,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-12-22 07:06:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:24,415 INFO L225 Difference]: With dead ends: 400 [2020-12-22 07:06:24,415 INFO L226 Difference]: Without dead ends: 259 [2020-12-22 07:06:24,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 07:06:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-12-22 07:06:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2020-12-22 07:06:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-12-22 07:06:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2020-12-22 07:06:24,439 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 102 [2020-12-22 07:06:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:24,439 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2020-12-22 07:06:24,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 07:06:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2020-12-22 07:06:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-22 07:06:24,441 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:06:24,441 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:06:24,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 07:06:24,441 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:06:24,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:06:24,442 INFO L82 PathProgramCache]: Analyzing trace with hash 961855834, now seen corresponding path program 1 times [2020-12-22 07:06:24,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:06:24,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108453535] [2020-12-22 07:06:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:06:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:06:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-22 07:06:24,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108453535] [2020-12-22 07:06:24,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:06:24,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 07:06:24,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186803244] [2020-12-22 07:06:24,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 07:06:24,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:06:24,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 07:06:24,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:06:24,557 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand 4 states. [2020-12-22 07:06:24,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:06:24,596 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2020-12-22 07:06:24,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 07:06:24,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-12-22 07:06:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:06:24,620 INFO L225 Difference]: With dead ends: 250 [2020-12-22 07:06:24,620 INFO L226 Difference]: Without dead ends: 0 [2020-12-22 07:06:24,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 07:06:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-22 07:06:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-22 07:06:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-22 07:06:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-22 07:06:24,625 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2020-12-22 07:06:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:06:24,625 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-22 07:06:24,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 07:06:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-22 07:06:24,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-22 07:06:24,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 07:06:24,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-22 07:06:25,118 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2020-12-22 07:06:25,522 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2020-12-22 07:06:25,670 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2020-12-22 07:06:26,135 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2020-12-22 07:06:26,331 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-12-22 07:06:26,632 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-12-22 07:06:26,860 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2020-12-22 07:06:27,120 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2020-12-22 07:06:27,411 WARN L197 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-12-22 07:06:27,822 WARN L197 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-12-22 07:06:27,988 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2020-12-22 07:06:28,679 WARN L197 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-22 07:06:28,911 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-12-22 07:06:29,570 WARN L197 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-22 07:06:30,285 WARN L197 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-22 07:06:30,962 WARN L197 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-22 07:06:31,717 WARN L197 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-22 07:06:31,968 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2020-12-22 07:06:32,267 WARN L197 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-12-22 07:06:32,452 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-12-22 07:06:33,154 WARN L197 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-22 07:06:33,849 WARN L197 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-22 07:06:34,103 WARN L197 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-12-22 07:06:34,764 WARN L197 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-22 07:06:35,420 WARN L197 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-22 07:06:36,064 WARN L197 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2020-12-22 07:06:36,073 INFO L189 CegarLoopUtils]: For program point L316(line 316) no Hoare annotation was computed. [2020-12-22 07:06:36,073 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2020-12-22 07:06:36,073 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-22 07:06:36,074 INFO L189 CegarLoopUtils]: For program point L53(lines 53 62) no Hoare annotation was computed. [2020-12-22 07:06:36,074 INFO L189 CegarLoopUtils]: For program point L53-2(lines 53 62) no Hoare annotation was computed. [2020-12-22 07:06:36,074 INFO L189 CegarLoopUtils]: For program point L53-3(lines 53 62) no Hoare annotation was computed. [2020-12-22 07:06:36,074 INFO L189 CegarLoopUtils]: For program point L53-5(lines 53 62) no Hoare annotation was computed. [2020-12-22 07:06:36,074 INFO L185 CegarLoopUtils]: At program point L301(lines 290 303) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-22 07:06:36,075 INFO L189 CegarLoopUtils]: For program point L268(lines 268 275) no Hoare annotation was computed. [2020-12-22 07:06:36,075 INFO L189 CegarLoopUtils]: For program point L153(lines 152 187) no Hoare annotation was computed. [2020-12-22 07:06:36,075 INFO L189 CegarLoopUtils]: For program point L54(lines 54 59) no Hoare annotation was computed. [2020-12-22 07:06:36,075 INFO L189 CegarLoopUtils]: For program point L54-1(lines 54 59) no Hoare annotation was computed. [2020-12-22 07:06:36,075 INFO L185 CegarLoopUtils]: At program point L302(lines 286 304) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-22 07:06:36,075 INFO L189 CegarLoopUtils]: For program point L253(lines 253 260) no Hoare annotation was computed. [2020-12-22 07:06:36,076 INFO L189 CegarLoopUtils]: For program point L220(lines 220 225) no Hoare annotation was computed. [2020-12-22 07:06:36,076 INFO L189 CegarLoopUtils]: For program point L220-1(lines 220 225) no Hoare annotation was computed. [2020-12-22 07:06:36,076 INFO L189 CegarLoopUtils]: For program point L154-1(lines 154 164) no Hoare annotation was computed. [2020-12-22 07:06:36,076 INFO L189 CegarLoopUtils]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-12-22 07:06:36,076 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-22 07:06:36,076 INFO L189 CegarLoopUtils]: For program point L240(line 240) no Hoare annotation was computed. [2020-12-22 07:06:36,076 INFO L189 CegarLoopUtils]: For program point L174(lines 174 186) no Hoare annotation was computed. [2020-12-22 07:06:36,076 INFO L189 CegarLoopUtils]: For program point L141(lines 141 149) no Hoare annotation was computed. [2020-12-22 07:06:36,076 INFO L189 CegarLoopUtils]: For program point L175(lines 175 181) no Hoare annotation was computed. [2020-12-22 07:06:36,077 INFO L189 CegarLoopUtils]: For program point L76(lines 76 80) no Hoare annotation was computed. [2020-12-22 07:06:36,077 INFO L185 CegarLoopUtils]: At program point L109-1(lines 97 134) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse8 (<= .cse21 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 .cse21)) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse7 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse5 (= ~q_free~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse11 (<= ~p_num_write~0 1)) (.cse12 (<= 1 ~p_num_write~0)) (.cse6 (= ~p_dw_pc~0 0)) (.cse0 (= ~q_read_ev~0 2)) (.cse20 (= ~c_dr_st~0 2)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse18 (= ~q_free~0 1)) (.cse13 (not (= ~q_write_ev~0 1))) (.cse19 (= ~c_num_read~0 0)) (.cse15 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse5 .cse8 .cse0 .cse9 .cse10 .cse14 .cse1 .cse13 .cse15) (and .cse6 .cse0 .cse10 .cse1 .cse16 .cse17 .cse4 .cse18 .cse13 .cse19) (and .cse7 .cse20 .cse2 .cse3 .cse4) (and .cse6 .cse20 .cse4 .cse18) (and .cse5 .cse7 .cse20 .cse10 .cse14) (and .cse5 .cse6 .cse7 .cse20 .cse10) (and .cse5 .cse6 .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse19 .cse15) (and .cse6 .cse0 .cse20 .cse10 .cse16 .cse17 .cse18 .cse13 .cse19 .cse15)))) [2020-12-22 07:06:36,077 INFO L189 CegarLoopUtils]: For program point L76-2(lines 76 80) no Hoare annotation was computed. [2020-12-22 07:06:36,077 INFO L189 CegarLoopUtils]: For program point L76-3(lines 76 80) no Hoare annotation was computed. [2020-12-22 07:06:36,077 INFO L189 CegarLoopUtils]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2020-12-22 07:06:36,077 INFO L189 CegarLoopUtils]: For program point L110(lines 109 129) no Hoare annotation was computed. [2020-12-22 07:06:36,077 INFO L189 CegarLoopUtils]: For program point L11(line 11) no Hoare annotation was computed. [2020-12-22 07:06:36,077 INFO L189 CegarLoopUtils]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-12-22 07:06:36,078 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-22 07:06:36,078 INFO L189 CegarLoopUtils]: For program point L144(lines 144 148) no Hoare annotation was computed. [2020-12-22 07:06:36,078 INFO L185 CegarLoopUtils]: At program point L111(lines 97 134) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~p_num_write~0 0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse7 (= ~c_num_read~0 0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse1 (= ~c_dr_st~0 2)) (.cse2 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 (= ~c_dr_st~0 0) .cse5 .cse2 .cse6 .cse7) (and .cse3 .cse1 (<= ~p_num_write~0 ~c_num_read~0) .cse4 (= ~p_dw_pc~0 1) .cse6 (<= ~c_num_read~0 ~p_num_write~0) .cse8) (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0) .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse2))) [2020-12-22 07:06:36,078 INFO L185 CegarLoopUtils]: At program point L45(lines 33 47) the Hoare annotation is: (let ((.cse8 (= ~c_dr_pc~0 1)) (.cse1 (= ~c_dr_st~0 2)) (.cse4 (= ~q_free~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= ~p_num_write~0 1)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse10 (<= 1 ~p_num_write~0)) (.cse3 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_num_read~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ ~c_num_read~0 1))) (and .cse4 (<= .cse5 ~p_num_write~0) .cse6 .cse1 (<= ~p_num_write~0 .cse5) .cse7 (= ~p_dw_pc~0 1) .cse2 .cse8)) (and .cse4 .cse0 .cse1 .cse6 .cse7 .cse2 .cse9 .cse10 .cse11 .cse8) (and .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse3) (and .cse4 .cse0 .cse6 .cse7 (= ~c_dr_st~0 0) .cse9 .cse2 .cse10 .cse3 .cse11))) [2020-12-22 07:06:36,079 INFO L185 CegarLoopUtils]: At program point L45-1(lines 33 47) the Hoare annotation is: (let ((.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse5 (= ~q_free~0 1)) (.cse9 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 (= ~c_dr_pc~0 0) .cse5 .cse9 .cse6 .cse7) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse4 .cse8 .cse5 .cse9))) [2020-12-22 07:06:36,079 INFO L185 CegarLoopUtils]: At program point L12-1(lines 140 192) the Hoare annotation is: (let ((.cse0 (= 2 ~p_dw_st~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse6 (= ~p_dw_pc~0 0)) (.cse1 (= ~q_read_ev~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= ~p_num_write~0 0)) (.cse9 (= ~q_free~0 1)) (.cse4 (not (= ~q_write_ev~0 1))) (.cse5 (= ~c_num_read~0 0))) (or (and (= ~q_free~0 0) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 1) (= ~c_dr_pc~0 0) (<= 1 ~p_num_write~0) .cse4 .cse5) (and .cse6 .cse0 .cse2 .cse7 .cse8 .cse9 .cse5) (and .cse1 .cse10 .cse11 .cse2 .cse3 .cse7 .cse9 .cse4 (<= ~c_num_read~0 ~p_num_write~0)) (and .cse0 .cse10 .cse2 .cse3 .cse7 (< ~c_num_read~0 (+ ~p_num_write~0 1)) (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0) .cse9) (and .cse6 .cse1 .cse11 .cse2 .cse7 .cse8 .cse9 .cse4 .cse5))) [2020-12-22 07:06:36,079 INFO L189 CegarLoopUtils]: For program point L244(lines 244 248) no Hoare annotation was computed. [2020-12-22 07:06:36,079 INFO L189 CegarLoopUtils]: For program point L244-1(lines 239 279) no Hoare annotation was computed. [2020-12-22 07:06:36,079 INFO L185 CegarLoopUtils]: At program point L145(lines 140 192) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (= 2 ~p_dw_st~0) (<= .cse0 ~p_num_write~0) (= ~q_read_ev~0 2) (<= ~p_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= ~p_dw_pc~0 1) (not (= ~q_write_ev~0 1)) (= ~c_dr_pc~0 1))) [2020-12-22 07:06:36,080 INFO L185 CegarLoopUtils]: At program point L46(lines 30 48) the Hoare annotation is: (let ((.cse13 (+ ~c_num_read~0 1))) (let ((.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~q_free~0 0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= .cse13 ~p_num_write~0)) (.cse3 (= ~q_read_ev~0 2)) (.cse5 (<= ~p_num_write~0 .cse13)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (<= ~p_num_write~0 1)) (.cse9 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse10 (<= 1 ~p_num_write~0)) (.cse4 (= ~c_dr_st~0 2)) (.cse12 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_pc~0 1) .cse7 .cse9 .cse11) (and .cse1 .cse4 .cse7 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (= ~c_dr_st~0 0) .cse8 .cse9 .cse12 .cse10) (and .cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse12)))) [2020-12-22 07:06:36,080 INFO L185 CegarLoopUtils]: At program point L46-1(lines 30 48) the Hoare annotation is: (let ((.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse5 (= ~q_free~0 1)) (.cse9 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 (= ~c_dr_pc~0 0) .cse5 .cse9 .cse6 .cse7) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse4 .cse8 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse5 .cse9))) [2020-12-22 07:06:36,080 INFO L192 CegarLoopUtils]: At program point L360(lines 351 362) the Hoare annotation is: true [2020-12-22 07:06:36,080 INFO L189 CegarLoopUtils]: For program point L294(lines 294 299) no Hoare annotation was computed. [2020-12-22 07:06:36,080 INFO L185 CegarLoopUtils]: At program point L228(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-22 07:06:36,081 INFO L185 CegarLoopUtils]: At program point L228-1(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-22 07:06:36,081 INFO L192 CegarLoopUtils]: At program point L328(lines 305 333) the Hoare annotation is: true [2020-12-22 07:06:36,081 INFO L185 CegarLoopUtils]: At program point L229(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-22 07:06:36,082 INFO L185 CegarLoopUtils]: At program point L229-1(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-22 07:06:36,082 INFO L185 CegarLoopUtils]: At program point L64(lines 52 66) the Hoare annotation is: (let ((.cse16 (+ ~c_num_read~0 1))) (let ((.cse6 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 2)) (.cse15 (= ~p_dw_pc~0 1)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~c_dr_pc~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (<= .cse16 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 .cse16)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= ~p_num_write~0 1)) (.cse13 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse14 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse9 .cse3 .cse0 .cse10 .cse11 .cse15 .cse6) (and .cse7 .cse8 .cse0 .cse11 .cse4 .cse1 .cse13 .cse5) (and .cse7 .cse0 .cse11 .cse15 .cse1) (and .cse3 (= ~c_dr_st~0 0) .cse4 .cse1 .cse5 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2020-12-22 07:06:36,082 INFO L185 CegarLoopUtils]: At program point L64-1(lines 52 66) the Hoare annotation is: (let ((.cse0 (= 2 ~p_dw_st~0)) (.cse6 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~p_num_write~0 1)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse7 (= ~q_free~0 1)) (.cse12 (<= 1 ~p_num_write~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse12) (and .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse12 .cse8 .cse9))) [2020-12-22 07:06:36,082 INFO L189 CegarLoopUtils]: For program point L98(lines 98 106) no Hoare annotation was computed. [2020-12-22 07:06:36,083 INFO L185 CegarLoopUtils]: At program point L65(lines 49 67) the Hoare annotation is: (let ((.cse17 (+ ~c_num_read~0 1))) (let ((.cse3 (= ~p_dw_pc~0 1)) (.cse9 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse0 (= ~q_free~0 0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (<= .cse17 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse17)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= ~p_num_write~0 1)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse15 (<= 1 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse16 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse0 .cse11 .cse6 .cse1 .cse12 .cse2 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse7 .cse4 .cse14 .cse8 .cse5) (and .cse6 (= ~c_dr_st~0 0) .cse7 .cse4 .cse8 .cse5 .cse16 .cse0 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse1 .cse4 .cse5 .cse16)))) [2020-12-22 07:06:36,083 INFO L185 CegarLoopUtils]: At program point L65-1(lines 49 67) the Hoare annotation is: (let ((.cse1 (= ~p_dw_st~0 0)) (.cse11 (= ~c_num_read~0 1)) (.cse12 (<= ~p_num_write~0 1)) (.cse13 (<= 1 ~p_num_write~0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse6 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse4 .cse12 .cse6 .cse7 .cse13 .cse8) (and .cse14 .cse11 .cse2 .cse3 .cse4 .cse12 .cse15 .cse7 .cse13) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-12-22 07:06:36,083 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-22 07:06:36,083 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2020-12-22 07:06:36,083 INFO L185 CegarLoopUtils]: At program point L280(lines 232 285) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-22 07:06:36,084 INFO L185 CegarLoopUtils]: At program point L264(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse0 .cse2 .cse13 .cse7) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-22 07:06:36,084 INFO L189 CegarLoopUtils]: For program point L198(lines 198 202) no Hoare annotation was computed. [2020-12-22 07:06:36,084 INFO L189 CegarLoopUtils]: For program point L198-2(lines 197 210) no Hoare annotation was computed. [2020-12-22 07:06:36,084 INFO L189 CegarLoopUtils]: For program point L34(lines 34 43) no Hoare annotation was computed. [2020-12-22 07:06:36,084 INFO L189 CegarLoopUtils]: For program point L34-2(lines 34 43) no Hoare annotation was computed. [2020-12-22 07:06:36,084 INFO L189 CegarLoopUtils]: For program point L34-3(lines 34 43) no Hoare annotation was computed. [2020-12-22 07:06:36,084 INFO L189 CegarLoopUtils]: For program point L34-5(lines 34 43) no Hoare annotation was computed. [2020-12-22 07:06:36,085 INFO L185 CegarLoopUtils]: At program point L348(lines 334 350) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (<= ~p_num_write~0 ~c_num_read~0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (not (= ~q_write_ev~0 1)) (<= ~c_num_read~0 ~p_num_write~0) (= ~c_num_read~0 0)) [2020-12-22 07:06:36,085 INFO L185 CegarLoopUtils]: At program point L315-1(lines 194 327) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-22 07:06:36,085 INFO L185 CegarLoopUtils]: At program point L249(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse12 (= ~c_dr_st~0 0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse19 (= ~q_free~0 0)) (.cse20 (<= .cse23 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 .cse23)) (.cse1 (= ~q_read_ev~0 2)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse2 (= ~c_dr_st~0 2)) (.cse4 (= ~p_dw_st~0 0)) (.cse22 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_free~0 1)) (.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse14 .cse2 .cse5 .cse6 .cse15 .cse7 .cse10) (and .cse16 .cse2 .cse17 .cse18 .cse13) (and .cse19 .cse14 .cse20 .cse1 .cse21 .cse5 .cse22 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse14 .cse5 .cse12 .cse6 .cse15 .cse13 .cse7 .cse10) (and .cse14 .cse5 (or (and .cse2 .cse22 .cse7) (and .cse16 .cse2 .cse22))) (and .cse14 .cse1 .cse12 .cse17 .cse18 .cse13 .cse19 .cse16 .cse20 .cse21 .cse5 .cse22 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8) (and .cse1 (or (and .cse16 .cse2 .cse4 .cse22) (and .cse2 .cse4 .cse22 .cse7)) .cse3 .cse5 .cse8 .cse9 .cse11)))) [2020-12-22 07:06:36,085 INFO L189 CegarLoopUtils]: For program point L216(lines 216 226) no Hoare annotation was computed. [2020-12-22 07:06:36,086 INFO L189 CegarLoopUtils]: For program point L216-1(lines 216 226) no Hoare annotation was computed. [2020-12-22 07:06:36,086 INFO L189 CegarLoopUtils]: For program point L84(lines 84 88) no Hoare annotation was computed. [2020-12-22 07:06:36,086 INFO L185 CegarLoopUtils]: At program point L84-2(lines 68 92) the Hoare annotation is: (let ((.cse19 (+ ~c_num_read~0 1))) (let ((.cse2 (= ~q_read_ev~0 2)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse1 (<= .cse19 ~p_num_write~0)) (.cse3 (<= ~p_num_write~0 .cse19)) (.cse15 (<= ~p_num_write~0 1)) (.cse17 (<= 1 ~p_num_write~0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse11 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse0 (= ~q_free~0 0)) (.cse13 (= ~p_dw_pc~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse18 (= ~c_dr_st~0 2)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse10 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse1 .cse3 .cse4 .cse15 .cse16 .cse17) (and .cse2 .cse8 .cse6 .cse10 .cse7 .cse0 .cse13 .cse1 .cse3 .cse4 .cse15 .cse16 .cse17) (and .cse14 .cse18 .cse9 .cse11 .cse12) (and .cse0 .cse14 .cse18 .cse4 .cse5) (and .cse0 .cse13 .cse14 .cse18 .cse4 .cse8 .cse16 .cse10)))) [2020-12-22 07:06:36,086 INFO L189 CegarLoopUtils]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2020-12-22 07:06:36,086 INFO L185 CegarLoopUtils]: At program point L84-5(lines 68 92) the Hoare annotation is: (let ((.cse9 (= ~p_dw_st~0 0)) (.cse4 (<= ~p_num_write~0 1)) (.cse7 (<= 1 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_pc~0 1)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse6 (= ~q_free~0 1)) (.cse10 (not (= ~q_write_ev~0 1))) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~c_dr_pc~0 1))) (or (and .cse0 (= ~c_num_read~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse2 .cse3 .cse6 .cse10 .cse11 .cse12) (and .cse9 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse11) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse10 .cse11 .cse12))) [2020-12-22 07:06:36,086 INFO L189 CegarLoopUtils]: For program point L101(lines 101 105) no Hoare annotation was computed. [2020-12-22 07:06:36,086 INFO L189 CegarLoopUtils]: For program point L35(lines 35 40) no Hoare annotation was computed. [2020-12-22 07:06:36,087 INFO L189 CegarLoopUtils]: For program point L35-1(lines 35 40) no Hoare annotation was computed. [2020-12-22 07:06:36,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:06:36 BoogieIcfgContainer [2020-12-22 07:06:36,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:06:36,155 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:06:36,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:06:36,155 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:06:36,155 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:06:20" (3/4) ... [2020-12-22 07:06:36,159 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-22 07:06:36,173 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-22 07:06:36,174 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-22 07:06:36,175 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 07:06:36,175 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-22 07:06:36,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,204 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,205 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,205 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,205 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,205 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,206 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,206 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,206 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1) [2020-12-22 07:06:36,206 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) || (((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write == 0) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read == 0)) || (((((((q_read_ev == 2 && c_dr_st == 2) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && p_num_write == 0) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) [2020-12-22 07:06:36,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1)) || (((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && q_read_ev == 2) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 1 <= p_num_write) && c_num_read == 0) && c_dr_pc == 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && __retres1 == 0) && 1 <= p_num_write) && c_dr_pc == 0) && c_num_read == 0) [2020-12-22 07:06:36,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 0 == \result) && 1 <= p_num_write) && c_dr_pc == 1) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_pc == 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0)) || (((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && c_dr_st == 0) && p_num_write <= 1) && 0 == \result) && c_dr_pc == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) [2020-12-22 07:06:36,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && 0 == \result) && q_free == 1) && 1 <= p_num_write) [2020-12-22 07:06:36,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result)) || ((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0)) || (((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write) [2020-12-22 07:06:36,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && \result == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || ((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) [2020-12-22 07:06:36,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((c_num_read == 1 && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && \result == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-12-22 07:06:36,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && c_dr_pc == 1) || (((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && c_dr_st == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && tmp == 0) && 0 == \result) [2020-12-22 07:06:36,243 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/pc_sfifo_1.cil-2.c-witness.graphml [2020-12-22 07:06:36,244 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:06:36,245 INFO L168 Benchmark]: Toolchain (without parser) took 17511.89 ms. Allocated memory was 154.1 MB in the beginning and 345.0 MB in the end (delta: 190.8 MB). Free memory was 129.0 MB in the beginning and 263.4 MB in the end (delta: -134.4 MB). Peak memory consumption was 57.8 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:36,245 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 154.1 MB. Free memory is still 125.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:06:36,246 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.33 ms. Allocated memory is still 154.1 MB. Free memory was 128.8 MB in the beginning and 117.1 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:36,246 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.69 ms. Allocated memory is still 154.1 MB. Free memory was 116.8 MB in the beginning and 115.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:36,246 INFO L168 Benchmark]: Boogie Preprocessor took 71.86 ms. Allocated memory is still 154.1 MB. Free memory was 115.0 MB in the beginning and 113.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:36,247 INFO L168 Benchmark]: RCFGBuilder took 859.20 ms. Allocated memory is still 154.1 MB. Free memory was 113.3 MB in the beginning and 122.4 MB in the end (delta: -9.1 MB). Peak memory consumption was 16.4 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:36,247 INFO L168 Benchmark]: TraceAbstraction took 15938.65 ms. Allocated memory was 154.1 MB in the beginning and 345.0 MB in the end (delta: 190.8 MB). Free memory was 122.4 MB in the beginning and 270.2 MB in the end (delta: -147.9 MB). Peak memory consumption was 198.7 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:36,247 INFO L168 Benchmark]: Witness Printer took 89.08 ms. Allocated memory is still 345.0 MB. Free memory was 270.2 MB in the beginning and 263.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. [2020-12-22 07:06:36,250 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 154.1 MB. Free memory is still 125.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 437.33 ms. Allocated memory is still 154.1 MB. Free memory was 128.8 MB in the beginning and 117.1 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 96.69 ms. Allocated memory is still 154.1 MB. Free memory was 116.8 MB in the beginning and 115.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 71.86 ms. Allocated memory is still 154.1 MB. Free memory was 115.0 MB in the beginning and 113.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 859.20 ms. Allocated memory is still 154.1 MB. Free memory was 113.3 MB in the beginning and 122.4 MB in the end (delta: -9.1 MB). Peak memory consumption was 16.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15938.65 ms. Allocated memory was 154.1 MB in the beginning and 345.0 MB in the end (delta: 190.8 MB). Free memory was 122.4 MB in the beginning and 270.2 MB in the end (delta: -147.9 MB). Peak memory consumption was 198.7 MB. Max. memory is 8.0 GB. * Witness Printer took 89.08 ms. Allocated memory is still 345.0 MB. Free memory was 270.2 MB in the beginning and 263.4 MB in the end (delta: 6.8 MB). Peak memory consumption was 7.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) || (((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write == 0) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read == 0)) || (((((((q_read_ev == 2 && c_dr_st == 2) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && p_num_write == 0) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write) || ((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((((p_dw_st == 0 && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && tmp == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && c_dr_pc == 1) || (((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && c_dr_st == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && tmp == 0) && 0 == \result) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((c_num_read == 1 && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && \result == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((q_free == 0 && 2 == p_dw_st) && q_read_ev == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && c_dr_pc == 0) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) || ((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((((((q_read_ev == 2 && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && c_num_read < p_num_write + 1) && tmp == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && \result == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || ((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && q_free == 1) && 1 <= p_num_write) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1)) || (((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && q_read_ev == 2) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 1 <= p_num_write) && c_num_read == 0) && c_dr_pc == 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && __retres1 == 0) && 1 <= p_num_write) && c_dr_pc == 0) && c_num_read == 0) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_dr_pc == 1 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((p_dw_st == 0 && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && __retres1 == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result)) || ((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0)) || (((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && 0 == \result) && q_free == 1) && 1 <= p_num_write) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 0 == \result) && 1 <= p_num_write) && c_dr_pc == 1) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_pc == 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0)) || (((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && c_dr_st == 0) && p_num_write <= 1) && 0 == \result) && c_dr_pc == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((q_read_ev == 2 && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.3s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2052 SDtfs, 1724 SDslu, 2161 SDs, 0 SdLazy, 206 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=633occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1368 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 241 NumberOfFragments, 5154 HoareAnnotationTreeSize, 27 FomulaSimplifications, 69948 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 27 FomulaSimplificationsInter, 11282 FormulaSimplificationTreeSizeReductionInter, 10.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 200654 SizeOfPredicates, 2 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 280/284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...