/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:48:50,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:48:50,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:48:50,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:48:50,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:48:50,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:48:50,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:48:50,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:48:50,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:48:50,493 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:48:50,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:48:50,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:48:50,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:48:50,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:48:50,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:48:50,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:48:50,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:48:50,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:48:50,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:48:50,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:48:50,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:48:50,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:48:50,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:48:50,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:48:50,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:48:50,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:48:50,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:48:50,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:48:50,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:48:50,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:48:50,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:48:50,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:48:50,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:48:50,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:48:50,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:48:50,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:48:50,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:48:50,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:48:50,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:48:50,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:48:50,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:48:50,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 22:48:50,569 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:48:50,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:48:50,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:48:50,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:48:50,576 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:48:50,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:48:50,576 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:48:50,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:48:50,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:48:50,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:48:50,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:48:50,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:48:50,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:48:50,578 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:48:50,578 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:48:50,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:48:50,578 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:48:50,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:48:50,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:48:50,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:48:50,579 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:48:50,579 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:48:50,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:48:50,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:48:50,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:48:50,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:48:50,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:48:50,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:48:50,580 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:48:50,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:48:50,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:48:50,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:48:50,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:48:50,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:48:50,860 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:48:50,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-11-23 22:48:50,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2bb895a4/d9ddbce889eb48a9bcabd350d621a4d0/FLAG2a68cf222 [2019-11-23 22:48:51,381 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:48:51,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-11-23 22:48:51,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2bb895a4/d9ddbce889eb48a9bcabd350d621a4d0/FLAG2a68cf222 [2019-11-23 22:48:51,726 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2bb895a4/d9ddbce889eb48a9bcabd350d621a4d0 [2019-11-23 22:48:51,736 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:48:51,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:48:51,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:51,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:48:51,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:48:51,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:51" (1/1) ... [2019-11-23 22:48:51,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e22e22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:51, skipping insertion in model container [2019-11-23 22:48:51,747 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:48:51" (1/1) ... [2019-11-23 22:48:51,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:48:51,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:48:52,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:52,024 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:48:52,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:48:52,101 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:48:52,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52 WrapperNode [2019-11-23 22:48:52,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:48:52,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:52,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:48:52,103 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:48:52,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:48:52,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:48:52,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:48:52,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:48:52,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (1/1) ... [2019-11-23 22:48:52,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:48:52,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:48:52,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:48:52,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:48:52,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (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 [2019-11-23 22:48:52,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:48:52,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:48:52,746 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:48:52,747 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-11-23 22:48:52,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:52 BoogieIcfgContainer [2019-11-23 22:48:52,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:48:52,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:48:52,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:48:52,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:48:52,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:48:51" (1/3) ... [2019-11-23 22:48:52,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc7cb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:52, skipping insertion in model container [2019-11-23 22:48:52,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:48:52" (2/3) ... [2019-11-23 22:48:52,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc7cb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:48:52, skipping insertion in model container [2019-11-23 22:48:52,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:48:52" (3/3) ... [2019-11-23 22:48:52,756 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-11-23 22:48:52,766 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:48:52,774 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-23 22:48:52,787 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-23 22:48:52,821 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:48:52,821 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:48:52,821 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:48:52,822 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:48:52,822 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:48:52,822 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:48:52,822 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:48:52,822 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:48:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-23 22:48:52,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-23 22:48:52,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:52,847 INFO L410 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] [2019-11-23 22:48:52,848 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:52,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2019-11-23 22:48:52,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:52,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264603261] [2019-11-23 22:48:52,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:53,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264603261] [2019-11-23 22:48:53,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:53,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:53,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988774861] [2019-11-23 22:48:53,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:53,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:53,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:53,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:53,053 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-11-23 22:48:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:53,166 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2019-11-23 22:48:53,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:53,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-23 22:48:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:53,188 INFO L225 Difference]: With dead ends: 214 [2019-11-23 22:48:53,189 INFO L226 Difference]: Without dead ends: 135 [2019-11-23 22:48:53,195 INFO L630 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 [2019-11-23 22:48:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-23 22:48:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2019-11-23 22:48:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-23 22:48:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2019-11-23 22:48:53,278 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2019-11-23 22:48:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:53,279 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2019-11-23 22:48:53,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2019-11-23 22:48:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:48:53,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:53,282 INFO L410 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] [2019-11-23 22:48:53,283 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:53,283 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2019-11-23 22:48:53,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:53,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460457076] [2019-11-23 22:48:53,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:53,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460457076] [2019-11-23 22:48:53,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:53,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:53,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441973934] [2019-11-23 22:48:53,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:53,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:53,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:53,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:53,368 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2019-11-23 22:48:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:53,453 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2019-11-23 22:48:53,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:53,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-23 22:48:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:53,463 INFO L225 Difference]: With dead ends: 323 [2019-11-23 22:48:53,463 INFO L226 Difference]: Without dead ends: 215 [2019-11-23 22:48:53,465 INFO L630 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 [2019-11-23 22:48:53,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-11-23 22:48:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2019-11-23 22:48:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-23 22:48:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2019-11-23 22:48:53,489 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2019-11-23 22:48:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:53,490 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2019-11-23 22:48:53,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2019-11-23 22:48:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-23 22:48:53,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:53,492 INFO L410 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] [2019-11-23 22:48:53,493 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:53,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:53,493 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2019-11-23 22:48:53,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:53,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025954641] [2019-11-23 22:48:53,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:53,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:53,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025954641] [2019-11-23 22:48:53,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:53,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:53,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485082961] [2019-11-23 22:48:53,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:53,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:53,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:53,548 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2019-11-23 22:48:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:53,603 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2019-11-23 22:48:53,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:53,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-23 22:48:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:53,607 INFO L225 Difference]: With dead ends: 526 [2019-11-23 22:48:53,607 INFO L226 Difference]: Without dead ends: 321 [2019-11-23 22:48:53,609 INFO L630 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 [2019-11-23 22:48:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-11-23 22:48:53,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2019-11-23 22:48:53,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-23 22:48:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2019-11-23 22:48:53,639 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2019-11-23 22:48:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:53,640 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2019-11-23 22:48:53,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:53,640 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2019-11-23 22:48:53,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-23 22:48:53,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:53,644 INFO L410 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] [2019-11-23 22:48:53,644 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:53,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:53,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2019-11-23 22:48:53,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:53,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923658421] [2019-11-23 22:48:53,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:53,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923658421] [2019-11-23 22:48:53,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:53,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:53,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397579534] [2019-11-23 22:48:53,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:53,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:53,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:53,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:53,733 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2019-11-23 22:48:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:53,791 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2019-11-23 22:48:53,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:53,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-23 22:48:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:53,795 INFO L225 Difference]: With dead ends: 740 [2019-11-23 22:48:53,795 INFO L226 Difference]: Without dead ends: 449 [2019-11-23 22:48:53,796 INFO L630 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 [2019-11-23 22:48:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-11-23 22:48:53,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2019-11-23 22:48:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-23 22:48:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2019-11-23 22:48:53,827 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2019-11-23 22:48:53,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:53,828 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2019-11-23 22:48:53,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:53,828 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2019-11-23 22:48:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:48:53,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:53,832 INFO L410 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] [2019-11-23 22:48:53,833 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2019-11-23 22:48:53,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:53,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103618299] [2019-11-23 22:48:53,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:53,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:53,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103618299] [2019-11-23 22:48:53,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:53,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:53,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561988837] [2019-11-23 22:48:53,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:53,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:53,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:53,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:53,919 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2019-11-23 22:48:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:53,967 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2019-11-23 22:48:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:53,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-23 22:48:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:53,971 INFO L225 Difference]: With dead ends: 914 [2019-11-23 22:48:53,971 INFO L226 Difference]: Without dead ends: 555 [2019-11-23 22:48:53,972 INFO L630 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 [2019-11-23 22:48:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-23 22:48:53,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-11-23 22:48:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-11-23 22:48:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2019-11-23 22:48:53,999 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2019-11-23 22:48:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:54,000 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2019-11-23 22:48:54,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:54,000 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2019-11-23 22:48:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:48:54,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:54,003 INFO L410 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] [2019-11-23 22:48:54,004 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2019-11-23 22:48:54,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:54,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947578979] [2019-11-23 22:48:54,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:48:54,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947578979] [2019-11-23 22:48:54,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:54,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:54,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39514694] [2019-11-23 22:48:54,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:54,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:54,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:54,085 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 3 states. [2019-11-23 22:48:54,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:54,129 INFO L93 Difference]: Finished difference Result 970 states and 1263 transitions. [2019-11-23 22:48:54,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:54,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-23 22:48:54,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:54,133 INFO L225 Difference]: With dead ends: 970 [2019-11-23 22:48:54,133 INFO L226 Difference]: Without dead ends: 553 [2019-11-23 22:48:54,134 INFO L630 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 [2019-11-23 22:48:54,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-11-23 22:48:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 512. [2019-11-23 22:48:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-23 22:48:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 649 transitions. [2019-11-23 22:48:54,159 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 649 transitions. Word has length 53 [2019-11-23 22:48:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:54,159 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 649 transitions. [2019-11-23 22:48:54,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 649 transitions. [2019-11-23 22:48:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:48:54,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:54,161 INFO L410 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] [2019-11-23 22:48:54,161 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:54,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:54,162 INFO L82 PathProgramCache]: Analyzing trace with hash -68365718, now seen corresponding path program 1 times [2019-11-23 22:48:54,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:54,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972465399] [2019-11-23 22:48:54,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:54,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972465399] [2019-11-23 22:48:54,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:54,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:48:54,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647789946] [2019-11-23 22:48:54,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:48:54,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:48:54,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:48:54,258 INFO L87 Difference]: Start difference. First operand 512 states and 649 transitions. Second operand 4 states. [2019-11-23 22:48:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:54,297 INFO L93 Difference]: Finished difference Result 557 states and 702 transitions. [2019-11-23 22:48:54,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:48:54,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-23 22:48:54,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:54,303 INFO L225 Difference]: With dead ends: 557 [2019-11-23 22:48:54,303 INFO L226 Difference]: Without dead ends: 555 [2019-11-23 22:48:54,304 INFO L630 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 [2019-11-23 22:48:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-23 22:48:54,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 510. [2019-11-23 22:48:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-23 22:48:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 646 transitions. [2019-11-23 22:48:54,338 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 646 transitions. Word has length 53 [2019-11-23 22:48:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:54,339 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 646 transitions. [2019-11-23 22:48:54,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:48:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 646 transitions. [2019-11-23 22:48:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:48:54,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:54,341 INFO L410 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] [2019-11-23 22:48:54,341 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:54,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:54,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2119348827, now seen corresponding path program 1 times [2019-11-23 22:48:54,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:54,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295628032] [2019-11-23 22:48:54,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:54,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295628032] [2019-11-23 22:48:54,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611793531] [2019-11-23 22:48:54,493 INFO L94 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 [2019-11-23 22:48:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:54,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-23 22:48:54,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 22:48:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:54,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-23 22:48:54,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-11-23 22:48:54,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632715632] [2019-11-23 22:48:54,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:48:54,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:54,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:48:54,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:54,686 INFO L87 Difference]: Start difference. First operand 510 states and 646 transitions. Second operand 7 states. [2019-11-23 22:48:54,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:54,773 INFO L93 Difference]: Finished difference Result 1064 states and 1348 transitions. [2019-11-23 22:48:54,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 22:48:54,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-11-23 22:48:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:54,779 INFO L225 Difference]: With dead ends: 1064 [2019-11-23 22:48:54,779 INFO L226 Difference]: Without dead ends: 1062 [2019-11-23 22:48:54,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:48:54,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2019-11-23 22:48:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 761. [2019-11-23 22:48:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-23 22:48:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 971 transitions. [2019-11-23 22:48:54,834 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 971 transitions. Word has length 54 [2019-11-23 22:48:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:54,834 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 971 transitions. [2019-11-23 22:48:54,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:48:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 971 transitions. [2019-11-23 22:48:54,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-23 22:48:54,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:54,838 INFO L410 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] [2019-11-23 22:48:55,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 22:48:55,046 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:55,046 INFO L82 PathProgramCache]: Analyzing trace with hash -797889608, now seen corresponding path program 2 times [2019-11-23 22:48:55,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:55,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790966292] [2019-11-23 22:48:55,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:55,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790966292] [2019-11-23 22:48:55,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:55,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:55,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004432896] [2019-11-23 22:48:55,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:55,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:55,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:55,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:55,101 INFO L87 Difference]: Start difference. First operand 761 states and 971 transitions. Second operand 3 states. [2019-11-23 22:48:55,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:55,153 INFO L93 Difference]: Finished difference Result 1240 states and 1589 transitions. [2019-11-23 22:48:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:55,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-11-23 22:48:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:55,157 INFO L225 Difference]: With dead ends: 1240 [2019-11-23 22:48:55,158 INFO L226 Difference]: Without dead ends: 705 [2019-11-23 22:48:55,159 INFO L630 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 [2019-11-23 22:48:55,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-23 22:48:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 685. [2019-11-23 22:48:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-23 22:48:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 860 transitions. [2019-11-23 22:48:55,198 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 860 transitions. Word has length 69 [2019-11-23 22:48:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:55,199 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 860 transitions. [2019-11-23 22:48:55,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 860 transitions. [2019-11-23 22:48:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 22:48:55,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:55,202 INFO L410 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] [2019-11-23 22:48:55,202 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:55,203 INFO L82 PathProgramCache]: Analyzing trace with hash -5008021, now seen corresponding path program 1 times [2019-11-23 22:48:55,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:55,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480790603] [2019-11-23 22:48:55,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:48:55,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480790603] [2019-11-23 22:48:55,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:55,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:55,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211848027] [2019-11-23 22:48:55,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:55,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:55,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:55,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:55,246 INFO L87 Difference]: Start difference. First operand 685 states and 860 transitions. Second operand 3 states. [2019-11-23 22:48:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:55,308 INFO L93 Difference]: Finished difference Result 1271 states and 1598 transitions. [2019-11-23 22:48:55,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:55,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-23 22:48:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:55,312 INFO L225 Difference]: With dead ends: 1271 [2019-11-23 22:48:55,331 INFO L226 Difference]: Without dead ends: 703 [2019-11-23 22:48:55,333 INFO L630 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 [2019-11-23 22:48:55,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-11-23 22:48:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 685. [2019-11-23 22:48:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-11-23 22:48:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 840 transitions. [2019-11-23 22:48:55,371 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 840 transitions. Word has length 80 [2019-11-23 22:48:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:55,371 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 840 transitions. [2019-11-23 22:48:55,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 840 transitions. [2019-11-23 22:48:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-23 22:48:55,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:55,373 INFO L410 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] [2019-11-23 22:48:55,374 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash 184036267, now seen corresponding path program 1 times [2019-11-23 22:48:55,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:55,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199218537] [2019-11-23 22:48:55,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:55,395 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-23 22:48:55,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199218537] [2019-11-23 22:48:55,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:55,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:55,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848038785] [2019-11-23 22:48:55,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:55,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:55,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:55,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:55,397 INFO L87 Difference]: Start difference. First operand 685 states and 840 transitions. Second operand 3 states. [2019-11-23 22:48:55,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:55,432 INFO L93 Difference]: Finished difference Result 1147 states and 1413 transitions. [2019-11-23 22:48:55,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:55,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-11-23 22:48:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:55,436 INFO L225 Difference]: With dead ends: 1147 [2019-11-23 22:48:55,436 INFO L226 Difference]: Without dead ends: 574 [2019-11-23 22:48:55,438 INFO L630 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 [2019-11-23 22:48:55,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-23 22:48:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-11-23 22:48:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-23 22:48:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 706 transitions. [2019-11-23 22:48:55,469 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 706 transitions. Word has length 80 [2019-11-23 22:48:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:55,469 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 706 transitions. [2019-11-23 22:48:55,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 706 transitions. [2019-11-23 22:48:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-23 22:48:55,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:48:55,473 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:48:55,473 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:48:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:48:55,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1014536047, now seen corresponding path program 1 times [2019-11-23 22:48:55,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:48:55,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017891208] [2019-11-23 22:48:55,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:48:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:48:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-23 22:48:55,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017891208] [2019-11-23 22:48:55,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:48:55,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:48:55,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503331271] [2019-11-23 22:48:55,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:48:55,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:48:55,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:48:55,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:48:55,514 INFO L87 Difference]: Start difference. First operand 574 states and 706 transitions. Second operand 3 states. [2019-11-23 22:48:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:48:55,555 INFO L93 Difference]: Finished difference Result 812 states and 995 transitions. [2019-11-23 22:48:55,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:48:55,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-23 22:48:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:48:55,556 INFO L225 Difference]: With dead ends: 812 [2019-11-23 22:48:55,556 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:48:55,558 INFO L630 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 [2019-11-23 22:48:55,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:48:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:48:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:48:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:48:55,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2019-11-23 22:48:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:48:55,559 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:48:55,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:48:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:48:55,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:48:55,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:48:56,153 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-23 22:48:56,372 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-23 22:48:56,858 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 22:48:57,396 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 22:48:57,753 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 22:48:57,958 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-11-23 22:48:58,332 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 22:48:58,641 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 22:48:58,952 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-11-23 22:48:59,342 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 22:48:59,698 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 22:49:00,103 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 22:49:00,461 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 22:49:00,818 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-23 22:49:00,840 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-23 22:49:00,840 INFO L444 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2019-11-23 22:49:00,840 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2019-11-23 22:49:00,840 INFO L444 ceAbstractionStarter]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2019-11-23 22:49:00,841 INFO L440 ceAbstractionStarter]: At program point L300(lines 284 302) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-23 22:49:00,841 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:49:00,841 INFO L444 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2019-11-23 22:49:00,841 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2019-11-23 22:49:00,841 INFO L444 ceAbstractionStarter]: For program point L218-1(lines 218 223) no Hoare annotation was computed. [2019-11-23 22:49:00,841 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2019-11-23 22:49:00,842 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-23 22:49:00,842 INFO L444 ceAbstractionStarter]: For program point L238(line 238) no Hoare annotation was computed. [2019-11-23 22:49:00,842 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2019-11-23 22:49:00,842 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2019-11-23 22:49:00,842 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2019-11-23 22:49:00,842 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2019-11-23 22:49:00,843 INFO L440 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse2 (= 1 ~q_free~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse0 (= ~c_num_read~0 0)) (.cse5 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse9 (= 0 ~q_free~0)) (.cse8 (<= 2 ~c_dr_st~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and (or (and .cse0 .cse9 (= 1 ~p_num_write~0) .cse3 .cse4) (let ((.cse10 (+ ~c_num_read~0 1))) (and (<= .cse10 ~p_num_write~0) .cse9 (<= ~p_num_write~0 .cse10) .cse4 .cse11))) .cse5 .cse6) (and (or (and .cse9 .cse8 .cse3 .cse4) (and .cse9 .cse8 .cse4 .cse11)) .cse6))) [2019-11-23 22:49:00,843 INFO L444 ceAbstractionStarter]: For program point L74-2(lines 74 78) no Hoare annotation was computed. [2019-11-23 22:49:00,844 INFO L444 ceAbstractionStarter]: For program point L74-3(lines 74 78) no Hoare annotation was computed. [2019-11-23 22:49:00,844 INFO L444 ceAbstractionStarter]: For program point L74-5(lines 74 78) no Hoare annotation was computed. [2019-11-23 22:49:00,844 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:49:00,844 INFO L444 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2019-11-23 22:49:00,844 INFO L444 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-23 22:49:00,844 INFO L444 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-23 22:49:00,844 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-11-23 22:49:00,845 INFO L440 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse1 (<= 2 ~c_dr_st~0)) (.cse0 (= ~c_num_read~0 0)) (.cse2 (= 0 ~p_dw_pc~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse1 .cse3 (= 1 ~p_dw_pc~0) .cse4) (and .cse0 (= ~c_dr_pc~0 0) .cse2 .cse3 (= ~c_dr_st~0 0) .cse4 .cse5))) [2019-11-23 22:49:00,845 INFO L440 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-11-23 22:49:00,845 INFO L440 ceAbstractionStarter]: At program point L43-1(lines 31 45) the Hoare annotation is: (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0) (= 1 ~c_dr_i~0)) [2019-11-23 22:49:00,845 INFO L440 ceAbstractionStarter]: At program point L10-1(lines 138 190) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~c_num_read~0 0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= 0 ~p_dw_st~0)) (.cse10 (= 0 ~p_dw_pc~0)) (.cse11 (= 0 ~p_num_write~0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~p_dw_pc~0)) (.cse7 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse2 .cse3 .cse10 .cse5 .cse7 .cse11) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse3 .cse4 .cse10 .cse5 .cse7 .cse11) (let ((.cse12 (+ ~c_num_read~0 1))) (and (<= .cse12 ~p_num_write~0) (= 0 ~q_free~0) .cse9 (<= ~p_num_write~0 .cse12) .cse5 .cse6 .cse7)))) [2019-11-23 22:49:00,846 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-11-23 22:49:00,846 INFO L444 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2019-11-23 22:49:00,846 INFO L440 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (<= .cse0 ~p_num_write~0) (= 0 ~q_free~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0) (= 1 ~c_dr_i~0))) [2019-11-23 22:49:00,846 INFO L440 ceAbstractionStarter]: At program point L44(lines 28 46) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-11-23 22:49:00,846 INFO L440 ceAbstractionStarter]: At program point L44-1(lines 28 46) the Hoare annotation is: (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (<= 2 ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0) (= 1 ~c_dr_i~0)) [2019-11-23 22:49:00,847 INFO L447 ceAbstractionStarter]: At program point L358(lines 349 360) the Hoare annotation is: true [2019-11-23 22:49:00,847 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2019-11-23 22:49:00,847 INFO L440 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-23 22:49:00,847 INFO L440 ceAbstractionStarter]: At program point L226-1(lines 213 228) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-23 22:49:00,847 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:49:00,848 INFO L447 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2019-11-23 22:49:00,848 INFO L440 ceAbstractionStarter]: At program point L227(lines 210 229) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-23 22:49:00,848 INFO L440 ceAbstractionStarter]: At program point L227-1(lines 210 229) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-23 22:49:00,848 INFO L440 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-11-23 22:49:00,849 INFO L440 ceAbstractionStarter]: At program point L62-1(lines 50 64) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 2 ~p_dw_st~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-23 22:49:00,849 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 104) no Hoare annotation was computed. [2019-11-23 22:49:00,849 INFO L440 ceAbstractionStarter]: At program point L63(lines 47 65) the Hoare annotation is: (let ((.cse0 (= ~c_num_read~0 0)) (.cse1 (= 0 ~q_free~0)) (.cse2 (= 1 ~p_num_write~0)) (.cse3 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_i~0 1))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (= ~c_dr_st~0 0) .cse5) (and (let ((.cse7 (<= 2 ~c_dr_st~0))) (or (let ((.cse6 (+ ~c_num_read~0 1))) (and (<= .cse6 ~p_num_write~0) .cse1 .cse7 (= ~p_dw_pc~0 1) (<= ~p_num_write~0 .cse6) .cse4)) (and .cse0 .cse1 .cse2 .cse7 .cse3 .cse4))) .cse5))) [2019-11-23 22:49:00,849 INFO L440 ceAbstractionStarter]: At program point L63-1(lines 47 65) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 2 ~p_dw_st~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-23 22:49:00,849 INFO L440 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-23 22:49:00,850 INFO L440 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-23 22:49:00,850 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 200) no Hoare annotation was computed. [2019-11-23 22:49:00,850 INFO L444 ceAbstractionStarter]: For program point L196-2(lines 195 208) no Hoare annotation was computed. [2019-11-23 22:49:00,850 INFO L444 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2019-11-23 22:49:00,850 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 22:49:00,850 INFO L444 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2019-11-23 22:49:00,851 INFO L444 ceAbstractionStarter]: For program point L32-3(lines 32 41) no Hoare annotation was computed. [2019-11-23 22:49:00,851 INFO L444 ceAbstractionStarter]: For program point L32-5(lines 32 41) no Hoare annotation was computed. [2019-11-23 22:49:00,851 INFO L440 ceAbstractionStarter]: At program point L346(lines 332 348) the Hoare annotation is: (and (= ~c_num_read~0 0) (= ~q_free~0 1) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (= ~c_dr_pc~0 0) (= 0 ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_dr_i~0 1) (= 0 ~p_num_write~0)) [2019-11-23 22:49:00,851 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-23 22:49:00,851 INFO L440 ceAbstractionStarter]: At program point L313-1(lines 192 325) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-23 22:49:00,852 INFO L440 ceAbstractionStarter]: At program point L247(lines 237 277) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-23 22:49:00,852 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2019-11-23 22:49:00,852 INFO L444 ceAbstractionStarter]: For program point L214-1(lines 214 224) no Hoare annotation was computed. [2019-11-23 22:49:00,852 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2019-11-23 22:49:00,852 INFO L440 ceAbstractionStarter]: At program point L82-2(lines 66 90) the Hoare annotation is: (let ((.cse1 (= 0 ~p_dw_pc~0)) (.cse0 (= 0 ~q_free~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= 1 ~p_dw_pc~0)) (.cse5 (= 1 ~c_dr_i~0))) (or (and (or (and (= ~c_num_read~0 0) .cse0 (= 1 ~p_num_write~0) .cse1 .cse2) (let ((.cse3 (+ ~c_num_read~0 1))) (and (<= .cse3 ~p_num_write~0) .cse0 (<= ~p_num_write~0 .cse3) .cse2 .cse4))) (= ~c_dr_st~0 0) .cse5) (and (let ((.cse6 (<= 2 ~c_dr_st~0))) (or (and .cse0 .cse6 .cse1 .cse2) (and .cse0 .cse6 .cse2 .cse4))) .cse5))) [2019-11-23 22:49:00,852 INFO L444 ceAbstractionStarter]: For program point L82-3(lines 82 86) no Hoare annotation was computed. [2019-11-23 22:49:00,852 INFO L440 ceAbstractionStarter]: At program point L82-5(lines 66 90) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse6 (= 1 ~c_dr_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 ~p_dw_st~0) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 2 ~p_dw_st~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-23 22:49:00,853 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2019-11-23 22:49:00,853 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-11-23 22:49:00,853 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 33 38) no Hoare annotation was computed. [2019-11-23 22:49:00,853 INFO L444 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2019-11-23 22:49:00,853 INFO L444 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2019-11-23 22:49:00,853 INFO L444 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2019-11-23 22:49:00,853 INFO L444 ceAbstractionStarter]: For program point L51-3(lines 51 60) no Hoare annotation was computed. [2019-11-23 22:49:00,853 INFO L444 ceAbstractionStarter]: For program point L51-5(lines 51 60) no Hoare annotation was computed. [2019-11-23 22:49:00,854 INFO L440 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: (let ((.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= 0 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_dr_st~0 0)) (.cse3 (= 0 ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 0)) (.cse14 (<= 2 ~p_dw_st~0)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= 1 ~q_free~0)) (.cse11 (= 0 ~p_dw_pc~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse13 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse3 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse5 .cse6) (and .cse15 .cse14 .cse2 .cse4 .cse5 .cse6) (let ((.cse16 (+ ~c_num_read~0 1))) (and (<= .cse16 ~p_num_write~0) .cse15 .cse14 (<= ~p_num_write~0 .cse16) .cse4 .cse12 .cse5 .cse6)) (and .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse13) (and .cse7 .cse2 .cse8 .cse9 .cse3 .cse11 .cse4 .cse6 .cse13) (and .cse7 .cse14 .cse2 .cse8 .cse9 .cse11 .cse4 .cse6 .cse13))) [2019-11-23 22:49:00,854 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2019-11-23 22:49:00,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:49:00 BoogieIcfgContainer [2019-11-23 22:49:00,911 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:49:00,913 INFO L168 Benchmark]: Toolchain (without parser) took 9175.25 ms. Allocated memory was 143.7 MB in the beginning and 337.1 MB in the end (delta: 193.5 MB). Free memory was 103.5 MB in the beginning and 257.8 MB in the end (delta: -154.3 MB). Peak memory consumption was 180.6 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:00,914 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 143.7 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 22:49:00,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.45 ms. Allocated memory is still 143.7 MB. Free memory was 103.3 MB in the beginning and 90.9 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:00,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.45 ms. Allocated memory was 143.7 MB in the beginning and 203.4 MB in the end (delta: 59.8 MB). Free memory was 90.9 MB in the beginning and 181.4 MB in the end (delta: -90.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:00,916 INFO L168 Benchmark]: Boogie Preprocessor took 32.97 ms. Allocated memory is still 203.4 MB. Free memory was 181.4 MB in the beginning and 179.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:00,917 INFO L168 Benchmark]: RCFGBuilder took 477.19 ms. Allocated memory is still 203.4 MB. Free memory was 179.0 MB in the beginning and 153.5 MB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:00,917 INFO L168 Benchmark]: TraceAbstraction took 8161.49 ms. Allocated memory was 203.4 MB in the beginning and 337.1 MB in the end (delta: 133.7 MB). Free memory was 153.5 MB in the beginning and 257.8 MB in the end (delta: -104.3 MB). Peak memory consumption was 170.9 MB. Max. memory is 7.1 GB. [2019-11-23 22:49:00,922 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 143.7 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 363.45 ms. Allocated memory is still 143.7 MB. Free memory was 103.3 MB in the beginning and 90.9 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 135.45 ms. Allocated memory was 143.7 MB in the beginning and 203.4 MB in the end (delta: 59.8 MB). Free memory was 90.9 MB in the beginning and 181.4 MB in the end (delta: -90.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.97 ms. Allocated memory is still 203.4 MB. Free memory was 181.4 MB in the beginning and 179.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 477.19 ms. Allocated memory is still 203.4 MB. Free memory was 179.0 MB in the beginning and 153.5 MB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8161.49 ms. Allocated memory was 203.4 MB in the beginning and 337.1 MB in the end (delta: 133.7 MB). Free memory was 153.5 MB in the beginning and 257.8 MB in the end (delta: -104.3 MB). Peak memory consumption was 170.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 9]: 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: 66]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) || ((((c_num_read + 1 <= p_num_write && 0 == q_free) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_dr_st == 0) && 1 == c_dr_i) || (((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) || (((0 == q_free && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 1 == c_dr_i) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write) || (((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 0 == p_dw_pc) && p_last_write == q_buf_0) || ((((c_num_read + 1 <= p_num_write && 0 == q_free) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && c_dr_st == 0) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) || (((0 == q_free && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc)) && 1 == c_dr_i) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((c_num_read == 0 && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || ((((((c_num_read == 0 && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 284]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= c_dr_st) && p_dw_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) || (((((c_num_read == 0 && 0 == q_free) && 1 == p_num_write) && 2 <= c_dr_st) && 0 == p_dw_pc) && p_last_write == q_buf_0)) && c_dr_i == 1) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= c_dr_st) && 0 == p_dw_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i) || (((((((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((0 == q_free && 2 <= p_dw_st) && 2 <= c_dr_st) && p_last_write == q_buf_0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == p_dw_pc) && 1 == c_dr_i)) || (((((((((c_num_read == 0 && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write)) || ((((((((c_num_read == 0 && 2 <= p_dw_st) && 2 <= c_dr_st) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_pc) && p_last_write == q_buf_0) && 1 == c_dr_i) && 0 == p_num_write) - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ((((((((c_num_read == 0 && q_free == 1) && c_last_read == p_last_write) && 0 == p_dw_st) && c_dr_pc == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_st == 0) && c_dr_i == 1) && 0 == p_num_write - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 2 error locations. Result: SAFE, OverallTime: 8.0s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.2s, HoareTripleCheckerStatistics: 1443 SDtfs, 1095 SDslu, 1141 SDs, 0 SdLazy, 117 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=761occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 474 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 157 NumberOfFragments, 3057 HoareAnnotationTreeSize, 27 FomulaSimplifications, 3145 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 27 FomulaSimplificationsInter, 2018 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 92635 SizeOfPredicates, 2 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 119/123 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...