./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 01:50:11,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 01:50:11,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 01:50:11,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 01:50:11,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 01:50:11,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 01:50:11,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 01:50:11,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 01:50:11,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 01:50:11,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 01:50:11,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 01:50:11,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 01:50:11,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 01:50:11,205 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 01:50:11,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 01:50:11,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 01:50:11,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 01:50:11,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 01:50:11,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 01:50:11,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 01:50:11,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 01:50:11,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 01:50:11,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 01:50:11,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 01:50:11,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 01:50:11,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 01:50:11,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 01:50:11,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 01:50:11,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 01:50:11,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 01:50:11,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 01:50:11,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 01:50:11,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 01:50:11,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 01:50:11,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 01:50:11,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 01:50:11,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 01:50:11,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 01:50:11,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 01:50:11,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 01:50:11,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 01:50:11,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 01:50:11,273 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 01:50:11,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 01:50:11,275 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 01:50:11,275 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 01:50:11,276 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 01:50:11,276 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 01:50:11,276 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 01:50:11,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 01:50:11,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 01:50:11,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 01:50:11,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 01:50:11,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 01:50:11,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 01:50:11,278 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 01:50:11,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 01:50:11,279 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 01:50:11,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 01:50:11,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 01:50:11,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 01:50:11,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 01:50:11,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 01:50:11,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 01:50:11,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 01:50:11,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 01:50:11,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 01:50:11,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 01:50:11,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 01:50:11,282 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 01:50:11,282 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 01:50:11,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 [2020-10-20 01:50:11,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 01:50:11,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 01:50:11,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 01:50:11,563 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 01:50:11,565 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 01:50:11,565 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-10-20 01:50:11,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4d92995/9482b503c3b24bb8909de3963b8cd46b/FLAGf9ac20931 [2020-10-20 01:50:12,151 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 01:50:12,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-10-20 01:50:12,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4d92995/9482b503c3b24bb8909de3963b8cd46b/FLAGf9ac20931 [2020-10-20 01:50:12,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e4d92995/9482b503c3b24bb8909de3963b8cd46b [2020-10-20 01:50:12,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 01:50:12,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 01:50:12,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 01:50:12,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 01:50:12,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 01:50:12,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:12,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167ad720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12, skipping insertion in model container [2020-10-20 01:50:12,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:12,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 01:50:12,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 01:50:12,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:50:12,885 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 01:50:12,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 01:50:12,941 INFO L208 MainTranslator]: Completed translation [2020-10-20 01:50:12,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12 WrapperNode [2020-10-20 01:50:12,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 01:50:12,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 01:50:12,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 01:50:12,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 01:50:12,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:12,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:12,997 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 01:50:12,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 01:50:12,998 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 01:50:12,998 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 01:50:13,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:13,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:13,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:13,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:13,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:13,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:13,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (1/1) ... [2020-10-20 01:50:13,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 01:50:13,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 01:50:13,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 01:50:13,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 01:50:13,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (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-10-20 01:50:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 01:50:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 01:50:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 01:50:13,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 01:50:13,588 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 01:50:13,589 INFO L298 CfgBuilder]: Removed 46 assume(true) statements. [2020-10-20 01:50:13,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:13 BoogieIcfgContainer [2020-10-20 01:50:13,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 01:50:13,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 01:50:13,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 01:50:13,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 01:50:13,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 01:50:12" (1/3) ... [2020-10-20 01:50:13,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ec4701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:50:13, skipping insertion in model container [2020-10-20 01:50:13,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 01:50:12" (2/3) ... [2020-10-20 01:50:13,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ec4701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 01:50:13, skipping insertion in model container [2020-10-20 01:50:13,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:13" (3/3) ... [2020-10-20 01:50:13,605 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-10-20 01:50:13,617 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 01:50:13,624 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 01:50:13,636 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-20 01:50:13,660 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 01:50:13,660 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 01:50:13,661 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 01:50:13,661 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 01:50:13,661 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 01:50:13,661 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 01:50:13,662 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 01:50:13,662 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 01:50:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-10-20 01:50:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-10-20 01:50:13,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:13,690 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-10-20 01:50:13,691 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:13,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:13,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512772, now seen corresponding path program 1 times [2020-10-20 01:50:13,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:13,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703274190] [2020-10-20 01:50:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:13,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703274190] [2020-10-20 01:50:13,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:13,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:13,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745419641] [2020-10-20 01:50:13,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:13,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:13,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:13,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:13,960 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-10-20 01:50:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:14,064 INFO L93 Difference]: Finished difference Result 216 states and 328 transitions. [2020-10-20 01:50:14,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:14,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-10-20 01:50:14,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:14,086 INFO L225 Difference]: With dead ends: 216 [2020-10-20 01:50:14,087 INFO L226 Difference]: Without dead ends: 135 [2020-10-20 01:50:14,091 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-10-20 01:50:14,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-20 01:50:14,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2020-10-20 01:50:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-20 01:50:14,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2020-10-20 01:50:14,162 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2020-10-20 01:50:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:14,163 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2020-10-20 01:50:14,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2020-10-20 01:50:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:50:14,166 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:14,166 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-10-20 01:50:14,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 01:50:14,167 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:14,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:14,167 INFO L82 PathProgramCache]: Analyzing trace with hash 317140169, now seen corresponding path program 1 times [2020-10-20 01:50:14,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:14,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8719025] [2020-10-20 01:50:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:14,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8719025] [2020-10-20 01:50:14,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:14,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:14,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810116750] [2020-10-20 01:50:14,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:14,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:14,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:14,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:14,252 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2020-10-20 01:50:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:14,314 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2020-10-20 01:50:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:14,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-20 01:50:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:14,318 INFO L225 Difference]: With dead ends: 323 [2020-10-20 01:50:14,318 INFO L226 Difference]: Without dead ends: 215 [2020-10-20 01:50:14,320 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-10-20 01:50:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-10-20 01:50:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2020-10-20 01:50:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-10-20 01:50:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2020-10-20 01:50:14,352 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2020-10-20 01:50:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:14,353 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2020-10-20 01:50:14,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2020-10-20 01:50:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-20 01:50:14,356 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:14,356 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-10-20 01:50:14,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 01:50:14,357 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:14,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:14,357 INFO L82 PathProgramCache]: Analyzing trace with hash -658420749, now seen corresponding path program 1 times [2020-10-20 01:50:14,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:14,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810349913] [2020-10-20 01:50:14,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:14,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:14,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810349913] [2020-10-20 01:50:14,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:14,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:14,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619146467] [2020-10-20 01:50:14,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:14,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:14,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:14,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:14,502 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2020-10-20 01:50:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:14,575 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2020-10-20 01:50:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:14,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-10-20 01:50:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:14,579 INFO L225 Difference]: With dead ends: 526 [2020-10-20 01:50:14,579 INFO L226 Difference]: Without dead ends: 321 [2020-10-20 01:50:14,581 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-10-20 01:50:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-10-20 01:50:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2020-10-20 01:50:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-10-20 01:50:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2020-10-20 01:50:14,618 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2020-10-20 01:50:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:14,619 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2020-10-20 01:50:14,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2020-10-20 01:50:14,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-20 01:50:14,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:14,623 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-10-20 01:50:14,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 01:50:14,624 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:14,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:14,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921099, now seen corresponding path program 1 times [2020-10-20 01:50:14,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:14,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224168881] [2020-10-20 01:50:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:14,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224168881] [2020-10-20 01:50:14,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:14,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:14,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541476797] [2020-10-20 01:50:14,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:14,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:14,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:14,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:14,696 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2020-10-20 01:50:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:14,771 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2020-10-20 01:50:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:14,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-10-20 01:50:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:14,775 INFO L225 Difference]: With dead ends: 740 [2020-10-20 01:50:14,775 INFO L226 Difference]: Without dead ends: 449 [2020-10-20 01:50:14,778 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-10-20 01:50:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2020-10-20 01:50:14,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2020-10-20 01:50:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-10-20 01:50:14,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2020-10-20 01:50:14,835 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2020-10-20 01:50:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:14,836 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2020-10-20 01:50:14,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2020-10-20 01:50:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-10-20 01:50:14,848 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:14,848 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-10-20 01:50:14,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 01:50:14,851 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:14,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:14,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870078, now seen corresponding path program 1 times [2020-10-20 01:50:14,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:14,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570952370] [2020-10-20 01:50:14,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:14,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570952370] [2020-10-20 01:50:14,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:14,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:14,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172482345] [2020-10-20 01:50:14,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:14,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:14,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:14,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:14,938 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2020-10-20 01:50:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:14,999 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2020-10-20 01:50:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:14,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-10-20 01:50:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:15,003 INFO L225 Difference]: With dead ends: 914 [2020-10-20 01:50:15,003 INFO L226 Difference]: Without dead ends: 555 [2020-10-20 01:50:15,005 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-10-20 01:50:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-10-20 01:50:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2020-10-20 01:50:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-10-20 01:50:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2020-10-20 01:50:15,032 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2020-10-20 01:50:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:15,033 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2020-10-20 01:50:15,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2020-10-20 01:50:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-20 01:50:15,035 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:15,035 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-10-20 01:50:15,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 01:50:15,036 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:15,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726775, now seen corresponding path program 1 times [2020-10-20 01:50:15,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:15,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76733997] [2020-10-20 01:50:15,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:15,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76733997] [2020-10-20 01:50:15,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:15,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:50:15,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855627636] [2020-10-20 01:50:15,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:50:15,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:15,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:50:15,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:15,116 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 5 states. [2020-10-20 01:50:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:15,230 INFO L93 Difference]: Finished difference Result 1620 states and 2104 transitions. [2020-10-20 01:50:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:15,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-10-20 01:50:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:15,237 INFO L225 Difference]: With dead ends: 1620 [2020-10-20 01:50:15,238 INFO L226 Difference]: Without dead ends: 1203 [2020-10-20 01:50:15,239 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-10-20 01:50:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-10-20 01:50:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 579. [2020-10-20 01:50:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2020-10-20 01:50:15,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 738 transitions. [2020-10-20 01:50:15,301 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 738 transitions. Word has length 53 [2020-10-20 01:50:15,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:15,302 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 738 transitions. [2020-10-20 01:50:15,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:50:15,302 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 738 transitions. [2020-10-20 01:50:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-20 01:50:15,304 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:15,304 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-10-20 01:50:15,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 01:50:15,305 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:15,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:15,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1443121531, now seen corresponding path program 1 times [2020-10-20 01:50:15,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:15,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190058362] [2020-10-20 01:50:15,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:15,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190058362] [2020-10-20 01:50:15,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:15,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 01:50:15,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031397212] [2020-10-20 01:50:15,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 01:50:15,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:15,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 01:50:15,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 01:50:15,362 INFO L87 Difference]: Start difference. First operand 579 states and 738 transitions. Second operand 5 states. [2020-10-20 01:50:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:15,492 INFO L93 Difference]: Finished difference Result 1356 states and 1736 transitions. [2020-10-20 01:50:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:15,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-10-20 01:50:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:15,499 INFO L225 Difference]: With dead ends: 1356 [2020-10-20 01:50:15,500 INFO L226 Difference]: Without dead ends: 866 [2020-10-20 01:50:15,501 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-10-20 01:50:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2020-10-20 01:50:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 480. [2020-10-20 01:50:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-10-20 01:50:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 610 transitions. [2020-10-20 01:50:15,560 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 610 transitions. Word has length 53 [2020-10-20 01:50:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:15,561 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 610 transitions. [2020-10-20 01:50:15,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 01:50:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 610 transitions. [2020-10-20 01:50:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-20 01:50:15,563 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:15,563 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-10-20 01:50:15,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 01:50:15,564 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:15,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:15,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1577075455, now seen corresponding path program 1 times [2020-10-20 01:50:15,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:15,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127282750] [2020-10-20 01:50:15,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 01:50:15,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127282750] [2020-10-20 01:50:15,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:15,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:15,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806646669] [2020-10-20 01:50:15,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:15,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:15,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:15,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:15,606 INFO L87 Difference]: Start difference. First operand 480 states and 610 transitions. Second operand 3 states. [2020-10-20 01:50:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:15,655 INFO L93 Difference]: Finished difference Result 862 states and 1099 transitions. [2020-10-20 01:50:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:15,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-10-20 01:50:15,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:15,659 INFO L225 Difference]: With dead ends: 862 [2020-10-20 01:50:15,659 INFO L226 Difference]: Without dead ends: 478 [2020-10-20 01:50:15,661 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-10-20 01:50:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-10-20 01:50:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 437. [2020-10-20 01:50:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-10-20 01:50:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 544 transitions. [2020-10-20 01:50:15,711 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 544 transitions. Word has length 53 [2020-10-20 01:50:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:15,715 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 544 transitions. [2020-10-20 01:50:15,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 544 transitions. [2020-10-20 01:50:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-20 01:50:15,717 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:15,717 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-10-20 01:50:15,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 01:50:15,718 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:15,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:15,718 INFO L82 PathProgramCache]: Analyzing trace with hash -179687324, now seen corresponding path program 1 times [2020-10-20 01:50:15,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:15,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084229518] [2020-10-20 01:50:15,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:15,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084229518] [2020-10-20 01:50:15,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:15,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:15,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813451048] [2020-10-20 01:50:15,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:15,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:15,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:15,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:15,812 INFO L87 Difference]: Start difference. First operand 437 states and 544 transitions. Second operand 4 states. [2020-10-20 01:50:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:15,867 INFO L93 Difference]: Finished difference Result 481 states and 596 transitions. [2020-10-20 01:50:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:15,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-10-20 01:50:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:15,870 INFO L225 Difference]: With dead ends: 481 [2020-10-20 01:50:15,871 INFO L226 Difference]: Without dead ends: 479 [2020-10-20 01:50:15,871 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-10-20 01:50:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-10-20 01:50:15,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 435. [2020-10-20 01:50:15,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-10-20 01:50:15,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 541 transitions. [2020-10-20 01:50:15,913 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 541 transitions. Word has length 53 [2020-10-20 01:50:15,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:15,914 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 541 transitions. [2020-10-20 01:50:15,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:15,914 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 541 transitions. [2020-10-20 01:50:15,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-20 01:50:15,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:15,916 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-10-20 01:50:15,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 01:50:15,916 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:15,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1275353301, now seen corresponding path program 1 times [2020-10-20 01:50:15,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:15,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695138844] [2020-10-20 01:50:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:16,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695138844] [2020-10-20 01:50:16,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690110032] [2020-10-20 01:50:16,062 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-10-20 01:50:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:16,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 01:50:16,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 01:50:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:16,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 01:50:16,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 01:50:16,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769259774] [2020-10-20 01:50:16,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 01:50:16,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:16,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 01:50:16,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 01:50:16,252 INFO L87 Difference]: Start difference. First operand 435 states and 541 transitions. Second operand 6 states. [2020-10-20 01:50:16,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:16,357 INFO L93 Difference]: Finished difference Result 781 states and 968 transitions. [2020-10-20 01:50:16,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 01:50:16,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-10-20 01:50:16,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:16,362 INFO L225 Difference]: With dead ends: 781 [2020-10-20 01:50:16,363 INFO L226 Difference]: Without dead ends: 779 [2020-10-20 01:50:16,364 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-10-20 01:50:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-10-20 01:50:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 633. [2020-10-20 01:50:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-10-20 01:50:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 794 transitions. [2020-10-20 01:50:16,431 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 794 transitions. Word has length 54 [2020-10-20 01:50:16,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:16,432 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 794 transitions. [2020-10-20 01:50:16,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 01:50:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 794 transitions. [2020-10-20 01:50:16,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-10-20 01:50:16,435 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:16,435 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-10-20 01:50:16,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-20 01:50:16,650 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:16,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash 602571322, now seen corresponding path program 2 times [2020-10-20 01:50:16,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:16,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921745689] [2020-10-20 01:50:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 01:50:16,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921745689] [2020-10-20 01:50:16,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:16,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:16,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156897347] [2020-10-20 01:50:16,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:16,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:16,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:16,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:16,687 INFO L87 Difference]: Start difference. First operand 633 states and 794 transitions. Second operand 3 states. [2020-10-20 01:50:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:16,760 INFO L93 Difference]: Finished difference Result 966 states and 1210 transitions. [2020-10-20 01:50:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:16,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-10-20 01:50:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:16,764 INFO L225 Difference]: With dead ends: 966 [2020-10-20 01:50:16,765 INFO L226 Difference]: Without dead ends: 629 [2020-10-20 01:50:16,766 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-10-20 01:50:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-10-20 01:50:16,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2020-10-20 01:50:16,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-10-20 01:50:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 719 transitions. [2020-10-20 01:50:16,814 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 719 transitions. Word has length 69 [2020-10-20 01:50:16,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:16,815 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 719 transitions. [2020-10-20 01:50:16,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:16,815 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 719 transitions. [2020-10-20 01:50:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-10-20 01:50:16,817 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:16,818 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-10-20 01:50:16,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 01:50:16,818 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:16,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:16,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1336457993, now seen corresponding path program 1 times [2020-10-20 01:50:16,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:16,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8124088] [2020-10-20 01:50:16,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 01:50:16,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8124088] [2020-10-20 01:50:16,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:16,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:16,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755402523] [2020-10-20 01:50:16,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:16,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:16,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:16,864 INFO L87 Difference]: Start difference. First operand 580 states and 719 transitions. Second operand 3 states. [2020-10-20 01:50:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:16,949 INFO L93 Difference]: Finished difference Result 1172 states and 1450 transitions. [2020-10-20 01:50:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:16,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-10-20 01:50:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:16,953 INFO L225 Difference]: With dead ends: 1172 [2020-10-20 01:50:16,954 INFO L226 Difference]: Without dead ends: 598 [2020-10-20 01:50:16,955 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-10-20 01:50:16,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-10-20 01:50:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 580. [2020-10-20 01:50:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-10-20 01:50:17,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 699 transitions. [2020-10-20 01:50:17,004 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 699 transitions. Word has length 80 [2020-10-20 01:50:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:17,005 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 699 transitions. [2020-10-20 01:50:17,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 699 transitions. [2020-10-20 01:50:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-20 01:50:17,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:17,008 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-10-20 01:50:17,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 01:50:17,008 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:17,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:17,009 INFO L82 PathProgramCache]: Analyzing trace with hash 393751957, now seen corresponding path program 1 times [2020-10-20 01:50:17,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:17,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744234431] [2020-10-20 01:50:17,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 01:50:17,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744234431] [2020-10-20 01:50:17,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:17,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:17,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46072451] [2020-10-20 01:50:17,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:17,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:17,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:17,060 INFO L87 Difference]: Start difference. First operand 580 states and 699 transitions. Second operand 3 states. [2020-10-20 01:50:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:17,128 INFO L93 Difference]: Finished difference Result 911 states and 1095 transitions. [2020-10-20 01:50:17,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:17,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-10-20 01:50:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:17,131 INFO L225 Difference]: With dead ends: 911 [2020-10-20 01:50:17,131 INFO L226 Difference]: Without dead ends: 284 [2020-10-20 01:50:17,133 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-10-20 01:50:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-10-20 01:50:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2020-10-20 01:50:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-20 01:50:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 320 transitions. [2020-10-20 01:50:17,157 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 320 transitions. Word has length 81 [2020-10-20 01:50:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:17,157 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 320 transitions. [2020-10-20 01:50:17,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 320 transitions. [2020-10-20 01:50:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-10-20 01:50:17,159 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:17,160 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-10-20 01:50:17,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 01:50:17,160 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:17,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:17,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1534139577, now seen corresponding path program 1 times [2020-10-20 01:50:17,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:17,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068009940] [2020-10-20 01:50:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 01:50:17,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068009940] [2020-10-20 01:50:17,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:17,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:17,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336363886] [2020-10-20 01:50:17,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:17,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:17,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:17,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:17,220 INFO L87 Difference]: Start difference. First operand 282 states and 320 transitions. Second operand 3 states. [2020-10-20 01:50:17,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:17,265 INFO L93 Difference]: Finished difference Result 401 states and 458 transitions. [2020-10-20 01:50:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:17,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-10-20 01:50:17,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:17,268 INFO L225 Difference]: With dead ends: 401 [2020-10-20 01:50:17,268 INFO L226 Difference]: Without dead ends: 279 [2020-10-20 01:50:17,269 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-10-20 01:50:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-10-20 01:50:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2020-10-20 01:50:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-10-20 01:50:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 315 transitions. [2020-10-20 01:50:17,290 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 315 transitions. Word has length 101 [2020-10-20 01:50:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:17,291 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 315 transitions. [2020-10-20 01:50:17,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 315 transitions. [2020-10-20 01:50:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-20 01:50:17,292 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:17,293 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-10-20 01:50:17,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 01:50:17,293 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:17,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:17,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1342369766, now seen corresponding path program 1 times [2020-10-20 01:50:17,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:17,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602878341] [2020-10-20 01:50:17,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-20 01:50:17,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602878341] [2020-10-20 01:50:17,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:17,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:17,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541972393] [2020-10-20 01:50:17,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:17,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:17,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:17,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:17,378 INFO L87 Difference]: Start difference. First operand 279 states and 315 transitions. Second operand 4 states. [2020-10-20 01:50:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:17,428 INFO L93 Difference]: Finished difference Result 395 states and 447 transitions. [2020-10-20 01:50:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 01:50:17,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-10-20 01:50:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:17,430 INFO L225 Difference]: With dead ends: 395 [2020-10-20 01:50:17,430 INFO L226 Difference]: Without dead ends: 270 [2020-10-20 01:50:17,433 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-10-20 01:50:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-10-20 01:50:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2020-10-20 01:50:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-10-20 01:50:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2020-10-20 01:50:17,460 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 102 [2020-10-20 01:50:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:17,461 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2020-10-20 01:50:17,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2020-10-20 01:50:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-20 01:50:17,462 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:17,463 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-10-20 01:50:17,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 01:50:17,464 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:17,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:17,464 INFO L82 PathProgramCache]: Analyzing trace with hash 759125341, now seen corresponding path program 1 times [2020-10-20 01:50:17,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:17,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097136930] [2020-10-20 01:50:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 01:50:17,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097136930] [2020-10-20 01:50:17,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:17,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 01:50:17,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515030047] [2020-10-20 01:50:17,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 01:50:17,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 01:50:17,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 01:50:17,523 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand 3 states. [2020-10-20 01:50:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:17,563 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2020-10-20 01:50:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 01:50:17,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-10-20 01:50:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:17,565 INFO L225 Difference]: With dead ends: 400 [2020-10-20 01:50:17,565 INFO L226 Difference]: Without dead ends: 259 [2020-10-20 01:50:17,566 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-10-20 01:50:17,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-10-20 01:50:17,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2020-10-20 01:50:17,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-10-20 01:50:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2020-10-20 01:50:17,585 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 102 [2020-10-20 01:50:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:17,585 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2020-10-20 01:50:17,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 01:50:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2020-10-20 01:50:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-20 01:50:17,588 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 01:50:17,588 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-10-20 01:50:17,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 01:50:17,589 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 01:50:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 01:50:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash 961855834, now seen corresponding path program 1 times [2020-10-20 01:50:17,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 01:50:17,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012664072] [2020-10-20 01:50:17,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 01:50:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 01:50:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 01:50:17,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012664072] [2020-10-20 01:50:17,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 01:50:17,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 01:50:17,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105673521] [2020-10-20 01:50:17,696 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 01:50:17,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 01:50:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 01:50:17,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 01:50:17,698 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand 4 states. [2020-10-20 01:50:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 01:50:17,728 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2020-10-20 01:50:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 01:50:17,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-10-20 01:50:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 01:50:17,729 INFO L225 Difference]: With dead ends: 250 [2020-10-20 01:50:17,729 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 01:50:17,730 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-10-20 01:50:17,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 01:50:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 01:50:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 01:50:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 01:50:17,732 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2020-10-20 01:50:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 01:50:17,732 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 01:50:17,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 01:50:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 01:50:17,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 01:50:17,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 01:50:17,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-20 01:50:18,191 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-10-20 01:50:18,324 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-10-20 01:50:18,458 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-10-20 01:50:18,602 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-10-20 01:50:18,793 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-10-20 01:50:18,900 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-10-20 01:50:19,382 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-10-20 01:50:19,610 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-10-20 01:50:19,904 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-10-20 01:50:20,119 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2020-10-20 01:50:20,382 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2020-10-20 01:50:20,645 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-10-20 01:50:20,988 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-10-20 01:50:21,122 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2020-10-20 01:50:21,665 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-10-20 01:50:21,835 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-10-20 01:50:22,400 WARN L193 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-10-20 01:50:22,964 WARN L193 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-10-20 01:50:23,480 WARN L193 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-10-20 01:50:24,054 WARN L193 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-10-20 01:50:24,211 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2020-10-20 01:50:24,459 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-10-20 01:50:24,641 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-10-20 01:50:25,182 WARN L193 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-10-20 01:50:25,734 WARN L193 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-10-20 01:50:25,949 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-10-20 01:50:26,525 WARN L193 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-10-20 01:50:27,070 WARN L193 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-10-20 01:50:27,602 WARN L193 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-10-20 01:50:27,606 INFO L274 CegarLoopResult]: For program point L316(line 316) no Hoare annotation was computed. [2020-10-20 01:50:27,607 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:50:27,607 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-20 01:50:27,607 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-20 01:50:27,607 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-20 01:50:27,607 INFO L274 CegarLoopResult]: For program point L53(lines 53 62) no Hoare annotation was computed. [2020-10-20 01:50:27,611 INFO L274 CegarLoopResult]: For program point L53-2(lines 53 62) no Hoare annotation was computed. [2020-10-20 01:50:27,611 INFO L274 CegarLoopResult]: For program point L53-3(lines 53 62) no Hoare annotation was computed. [2020-10-20 01:50:27,611 INFO L274 CegarLoopResult]: For program point L53-5(lines 53 62) no Hoare annotation was computed. [2020-10-20 01:50:27,614 INFO L270 CegarLoopResult]: At program point L301(lines 290 303) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~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 .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-10-20 01:50:27,614 INFO L274 CegarLoopResult]: For program point L268(lines 268 275) no Hoare annotation was computed. [2020-10-20 01:50:27,614 INFO L274 CegarLoopResult]: For program point L153(lines 152 187) no Hoare annotation was computed. [2020-10-20 01:50:27,614 INFO L274 CegarLoopResult]: For program point L54(lines 54 59) no Hoare annotation was computed. [2020-10-20 01:50:27,614 INFO L274 CegarLoopResult]: For program point L54-1(lines 54 59) no Hoare annotation was computed. [2020-10-20 01:50:27,614 INFO L270 CegarLoopResult]: At program point L302(lines 286 304) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~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 .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-10-20 01:50:27,615 INFO L274 CegarLoopResult]: For program point L253(lines 253 260) no Hoare annotation was computed. [2020-10-20 01:50:27,615 INFO L274 CegarLoopResult]: For program point L220(lines 220 225) no Hoare annotation was computed. [2020-10-20 01:50:27,615 INFO L274 CegarLoopResult]: For program point L220-1(lines 220 225) no Hoare annotation was computed. [2020-10-20 01:50:27,615 INFO L274 CegarLoopResult]: For program point L154-1(lines 154 164) no Hoare annotation was computed. [2020-10-20 01:50:27,615 INFO L274 CegarLoopResult]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-10-20 01:50:27,615 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-20 01:50:27,615 INFO L274 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-10-20 01:50:27,615 INFO L274 CegarLoopResult]: For program point L174(lines 174 186) no Hoare annotation was computed. [2020-10-20 01:50:27,616 INFO L274 CegarLoopResult]: For program point L141(lines 141 149) no Hoare annotation was computed. [2020-10-20 01:50:27,616 INFO L274 CegarLoopResult]: For program point L175(lines 175 181) no Hoare annotation was computed. [2020-10-20 01:50:27,616 INFO L274 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2020-10-20 01:50:27,616 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,616 INFO L274 CegarLoopResult]: For program point L76-2(lines 76 80) no Hoare annotation was computed. [2020-10-20 01:50:27,616 INFO L274 CegarLoopResult]: For program point L76-3(lines 76 80) no Hoare annotation was computed. [2020-10-20 01:50:27,616 INFO L274 CegarLoopResult]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2020-10-20 01:50:27,616 INFO L274 CegarLoopResult]: For program point L110(lines 109 129) no Hoare annotation was computed. [2020-10-20 01:50:27,616 INFO L274 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-10-20 01:50:27,617 INFO L274 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-10-20 01:50:27,617 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-20 01:50:27,617 INFO L274 CegarLoopResult]: For program point L144(lines 144 148) no Hoare annotation was computed. [2020-10-20 01:50:27,617 INFO L270 CegarLoopResult]: At program point L111(lines 97 134) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse5 (= ~p_num_write~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse2 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 2)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse8 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 (= ~c_dr_st~0 0) .cse5 .cse2 .cse6 .cse7) (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) (and .cse1 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 (= ~p_dw_pc~0 1) .cse6 (<= ~c_num_read~0 ~p_num_write~0) .cse8))) [2020-10-20 01:50:27,617 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,617 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,617 INFO L270 CegarLoopResult]: At program point L12-1(lines 140 192) the Hoare annotation is: (let ((.cse0 (= 2 ~p_dw_st~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~p_num_write~0 0)) (.cse8 (= ~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 .cse0 .cse6 .cse2 .cse3 .cse7 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0) .cse8 .cse9) (and .cse10 .cse0 .cse2 .cse7 .cse11 .cse8 .cse5) (and .cse1 .cse6 .cse12 .cse2 .cse3 .cse7 .cse8 .cse4 .cse9) (and .cse10 .cse1 .cse12 .cse2 .cse7 .cse11 .cse8 .cse4 .cse5))) [2020-10-20 01:50:27,618 INFO L274 CegarLoopResult]: For program point L244(lines 244 248) no Hoare annotation was computed. [2020-10-20 01:50:27,618 INFO L274 CegarLoopResult]: For program point L244-1(lines 239 279) no Hoare annotation was computed. [2020-10-20 01:50:27,618 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,618 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,618 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,618 INFO L277 CegarLoopResult]: At program point L360(lines 351 362) the Hoare annotation is: true [2020-10-20 01:50:27,618 INFO L274 CegarLoopResult]: For program point L294(lines 294 299) no Hoare annotation was computed. [2020-10-20 01:50:27,619 INFO L270 CegarLoopResult]: At program point L228(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~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 .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-10-20 01:50:27,619 INFO L270 CegarLoopResult]: At program point L228-1(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~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 .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-10-20 01:50:27,619 INFO L277 CegarLoopResult]: At program point L328(lines 305 333) the Hoare annotation is: true [2020-10-20 01:50:27,620 INFO L270 CegarLoopResult]: At program point L229(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~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 .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-10-20 01:50:27,620 INFO L270 CegarLoopResult]: At program point L229-1(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~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 .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-10-20 01:50:27,620 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,621 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,621 INFO L274 CegarLoopResult]: For program point L98(lines 98 106) no Hoare annotation was computed. [2020-10-20 01:50:27,621 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,621 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,621 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-20 01:50:27,621 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-20 01:50:27,622 INFO L270 CegarLoopResult]: At program point L280(lines 232 285) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~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 .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-10-20 01:50:27,622 INFO L270 CegarLoopResult]: At program point L264(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~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 .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse0 .cse2 .cse13 .cse7) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-10-20 01:50:27,622 INFO L274 CegarLoopResult]: For program point L198(lines 198 202) no Hoare annotation was computed. [2020-10-20 01:50:27,622 INFO L274 CegarLoopResult]: For program point L198-2(lines 197 210) no Hoare annotation was computed. [2020-10-20 01:50:27,622 INFO L274 CegarLoopResult]: For program point L34(lines 34 43) no Hoare annotation was computed. [2020-10-20 01:50:27,624 INFO L274 CegarLoopResult]: For program point L34-2(lines 34 43) no Hoare annotation was computed. [2020-10-20 01:50:27,624 INFO L274 CegarLoopResult]: For program point L34-3(lines 34 43) no Hoare annotation was computed. [2020-10-20 01:50:27,624 INFO L274 CegarLoopResult]: For program point L34-5(lines 34 43) no Hoare annotation was computed. [2020-10-20 01:50:27,624 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,624 INFO L270 CegarLoopResult]: At program point L315-1(lines 194 327) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~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 .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-10-20 01:50:27,624 INFO L270 CegarLoopResult]: At program point L249(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~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 .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-10-20 01:50:27,625 INFO L274 CegarLoopResult]: For program point L216(lines 216 226) no Hoare annotation was computed. [2020-10-20 01:50:27,625 INFO L274 CegarLoopResult]: For program point L216-1(lines 216 226) no Hoare annotation was computed. [2020-10-20 01:50:27,625 INFO L274 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2020-10-20 01:50:27,625 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,626 INFO L274 CegarLoopResult]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2020-10-20 01:50:27,626 INFO L270 CegarLoopResult]: 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-10-20 01:50:27,626 INFO L274 CegarLoopResult]: For program point L101(lines 101 105) no Hoare annotation was computed. [2020-10-20 01:50:27,626 INFO L274 CegarLoopResult]: For program point L35(lines 35 40) no Hoare annotation was computed. [2020-10-20 01:50:27,626 INFO L274 CegarLoopResult]: For program point L35-1(lines 35 40) no Hoare annotation was computed. [2020-10-20 01:50:27,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 01:50:27 BoogieIcfgContainer [2020-10-20 01:50:27,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 01:50:27,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 01:50:27,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 01:50:27,749 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 01:50:27,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 01:50:13" (3/4) ... [2020-10-20 01:50:27,754 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 01:50:27,773 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-20 01:50:27,774 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-20 01:50:27,775 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:50:27,775 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 01:50:27,824 WARN L221 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) [2020-10-20 01:50:27,825 WARN L221 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) [2020-10-20 01:50:27,825 WARN L221 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) [2020-10-20 01:50:27,826 WARN L221 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) [2020-10-20 01:50:27,827 WARN L221 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) [2020-10-20 01:50:27,827 WARN L221 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) [2020-10-20 01:50:27,827 WARN L221 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) [2020-10-20 01:50:27,828 WARN L221 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) [2020-10-20 01:50:27,829 WARN L221 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) [2020-10-20 01:50:27,829 WARN L221 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) [2020-10-20 01:50:27,830 WARN L221 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-10-20 01:50:27,830 WARN L221 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)) || (((((((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)) || (((((((c_dr_st == 2 && q_read_ev == 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) [2020-10-20 01:50:27,832 WARN L221 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-10-20 01:50:27,833 WARN L221 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-10-20 01:50:27,833 WARN L221 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-10-20 01:50:27,834 WARN L221 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-10-20 01:50:27,834 WARN L221 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-10-20 01:50:27,835 WARN L221 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-10-20 01:50:27,835 WARN L221 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-10-20 01:50:27,897 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 01:50:27,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 01:50:27,899 INFO L168 Benchmark]: Toolchain (without parser) took 15353.64 ms. Allocated memory was 35.7 MB in the beginning and 127.4 MB in the end (delta: 91.8 MB). Free memory was 15.7 MB in the beginning and 56.0 MB in the end (delta: -40.3 MB). Peak memory consumption was 51.5 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:27,900 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 34.1 MB. Free memory was 10.3 MB in the beginning and 10.2 MB in the end (delta: 45.5 kB). Peak memory consumption was 45.5 kB. Max. memory is 14.3 GB. [2020-10-20 01:50:27,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.64 ms. Allocated memory was 35.7 MB in the beginning and 44.0 MB in the end (delta: 8.4 MB). Free memory was 14.9 MB in the beginning and 23.4 MB in the end (delta: -8.5 MB). Peak memory consumption was 10.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:27,900 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.18 ms. Allocated memory is still 44.0 MB. Free memory was 23.4 MB in the beginning and 21.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:27,901 INFO L168 Benchmark]: Boogie Preprocessor took 36.25 ms. Allocated memory is still 44.0 MB. Free memory was 21.1 MB in the beginning and 19.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:27,902 INFO L168 Benchmark]: RCFGBuilder took 557.31 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 19.2 MB in the beginning and 21.1 MB in the end (delta: -1.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:27,902 INFO L168 Benchmark]: TraceAbstraction took 14154.76 ms. Allocated memory was 46.1 MB in the beginning and 127.4 MB in the end (delta: 81.3 MB). Free memory was 20.6 MB in the beginning and 63.9 MB in the end (delta: -43.4 MB). Peak memory consumption was 97.1 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:27,903 INFO L168 Benchmark]: Witness Printer took 149.30 ms. Allocated memory is still 127.4 MB. Free memory was 63.9 MB in the beginning and 56.0 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 14.3 GB. [2020-10-20 01:50:27,907 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.78 ms. Allocated memory is still 34.1 MB. Free memory was 10.3 MB in the beginning and 10.2 MB in the end (delta: 45.5 kB). Peak memory consumption was 45.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 390.64 ms. Allocated memory was 35.7 MB in the beginning and 44.0 MB in the end (delta: 8.4 MB). Free memory was 14.9 MB in the beginning and 23.4 MB in the end (delta: -8.5 MB). Peak memory consumption was 10.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 54.18 ms. Allocated memory is still 44.0 MB. Free memory was 23.4 MB in the beginning and 21.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 36.25 ms. Allocated memory is still 44.0 MB. Free memory was 21.1 MB in the beginning and 19.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 14.3 GB. * RCFGBuilder took 557.31 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 19.2 MB in the beginning and 21.1 MB in the end (delta: -1.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 14.3 GB. * TraceAbstraction took 14154.76 ms. Allocated memory was 46.1 MB in the beginning and 127.4 MB in the end (delta: 81.3 MB). Free memory was 20.6 MB in the beginning and 63.9 MB in the end (delta: -43.4 MB). Peak memory consumption was 97.1 MB. Max. memory is 14.3 GB. * Witness Printer took 149.30 ms. Allocated memory is still 127.4 MB. Free memory was 63.9 MB in the beginning and 56.0 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() 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)) || (((((((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)) || (((((((c_dr_st == 2 && q_read_ev == 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) - 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) || (((((((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) && c_num_read <= p_num_write)) || ((((((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)) || ((((((((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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) - 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) - 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) - 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) - 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) - 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) - 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) - 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) - 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) - 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)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((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_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((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)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.0s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.8s, 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.2s 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, 5152 HoareAnnotationTreeSize, 27 FomulaSimplifications, 69970 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 27 FomulaSimplificationsInter, 11166 FormulaSimplificationTreeSizeReductionInter, 8.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 199170 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...