/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/taipan/svcomp-Reach-32bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-24 06:05:01,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-24 06:05:01,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-24 06:05:01,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-24 06:05:01,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-24 06:05:01,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-24 06:05:01,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-24 06:05:01,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-24 06:05:01,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-24 06:05:01,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-24 06:05:01,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-24 06:05:01,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-24 06:05:01,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-24 06:05:01,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-24 06:05:01,656 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-24 06:05:01,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-24 06:05:01,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-24 06:05:01,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-24 06:05:01,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-24 06:05:01,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-24 06:05:01,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-24 06:05:01,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-24 06:05:01,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-24 06:05:01,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-24 06:05:01,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-24 06:05:01,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-24 06:05:01,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-24 06:05:01,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-24 06:05:01,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-24 06:05:01,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-24 06:05:01,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-24 06:05:01,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-24 06:05:01,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-24 06:05:01,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-24 06:05:01,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-24 06:05:01,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-24 06:05:01,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-24 06:05:01,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-24 06:05:01,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-24 06:05:01,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-24 06:05:01,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-24 06:05:01,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-24 06:05:01,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-24 06:05:01,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-24 06:05:01,724 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-24 06:05:01,725 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-24 06:05:01,725 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-24 06:05:01,725 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-24 06:05:01,725 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-24 06:05:01,725 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-24 06:05:01,726 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-24 06:05:01,726 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-24 06:05:01,726 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-24 06:05:01,726 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-24 06:05:01,726 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-24 06:05:01,726 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-24 06:05:01,727 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-24 06:05:01,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-24 06:05:01,728 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-24 06:05:01,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-24 06:05:01,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-24 06:05:01,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-24 06:05:01,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-24 06:05:01,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-24 06:05:01,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-24 06:05:01,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-24 06:05:01,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-24 06:05:01,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-24 06:05:01,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-24 06:05:01,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-24 06:05:01,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-24 06:05:01,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-24 06:05:01,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-24 06:05:01,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-24 06:05:01,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-24 06:05:01,731 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-24 06:05:01,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-24 06:05:01,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-24 06:05:01,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-24 06:05:01,732 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-11-24 06:05:01,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-24 06:05:02,009 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-24 06:05:02,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-24 06:05:02,014 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-24 06:05:02,015 INFO L275 PluginConnector]: CDTParser initialized [2019-11-24 06:05:02,016 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-24 06:05:02,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d3b7a5d/fea5c1b6b7b341f49ca516479924aaec/FLAGcb16791ac [2019-11-24 06:05:02,498 INFO L306 CDTParser]: Found 1 translation units. [2019-11-24 06:05:02,499 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-11-24 06:05:02,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d3b7a5d/fea5c1b6b7b341f49ca516479924aaec/FLAGcb16791ac [2019-11-24 06:05:02,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5d3b7a5d/fea5c1b6b7b341f49ca516479924aaec [2019-11-24 06:05:02,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-24 06:05:02,870 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-24 06:05:02,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:02,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-24 06:05:02,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-24 06:05:02,876 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:02" (1/1) ... [2019-11-24 06:05:02,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23bf5d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:02, skipping insertion in model container [2019-11-24 06:05:02,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 06:05:02" (1/1) ... [2019-11-24 06:05:02,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-24 06:05:02,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-24 06:05:03,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:03,174 INFO L203 MainTranslator]: Completed pre-run [2019-11-24 06:05:03,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-24 06:05:03,308 INFO L208 MainTranslator]: Completed translation [2019-11-24 06:05:03,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03 WrapperNode [2019-11-24 06:05:03,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-24 06:05:03,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:03,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-24 06:05:03,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-24 06:05:03,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (1/1) ... [2019-11-24 06:05:03,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (1/1) ... [2019-11-24 06:05:03,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-24 06:05:03,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-24 06:05:03,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-24 06:05:03,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-24 06:05:03,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (1/1) ... [2019-11-24 06:05:03,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (1/1) ... [2019-11-24 06:05:03,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (1/1) ... [2019-11-24 06:05:03,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (1/1) ... [2019-11-24 06:05:03,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (1/1) ... [2019-11-24 06:05:03,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (1/1) ... [2019-11-24 06:05:03,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (1/1) ... [2019-11-24 06:05:03,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-24 06:05:03,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-24 06:05:03,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-24 06:05:03,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-24 06:05:03,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (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-24 06:05:03,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-24 06:05:03,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-24 06:05:04,095 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-24 06:05:04,096 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-11-24 06:05:04,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:04 BoogieIcfgContainer [2019-11-24 06:05:04,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-24 06:05:04,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-24 06:05:04,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-24 06:05:04,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-24 06:05:04,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 06:05:02" (1/3) ... [2019-11-24 06:05:04,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b83559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:04, skipping insertion in model container [2019-11-24 06:05:04,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 06:05:03" (2/3) ... [2019-11-24 06:05:04,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52b83559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 06:05:04, skipping insertion in model container [2019-11-24 06:05:04,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 06:05:04" (3/3) ... [2019-11-24 06:05:04,106 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-11-24 06:05:04,116 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-24 06:05:04,125 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-24 06:05:04,137 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-24 06:05:04,169 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-24 06:05:04,169 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-24 06:05:04,170 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-24 06:05:04,170 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-24 06:05:04,170 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-24 06:05:04,170 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-24 06:05:04,170 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-24 06:05:04,171 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-24 06:05:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-24 06:05:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-24 06:05:04,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:04,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:04,205 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1931114158, now seen corresponding path program 1 times [2019-11-24 06:05:04,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:04,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952677562] [2019-11-24 06:05:04,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:04,367 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-24 06:05:04,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952677562] [2019-11-24 06:05:04,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:04,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:04,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121980471] [2019-11-24 06:05:04,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:04,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:04,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:04,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:04,394 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2019-11-24 06:05:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:04,484 INFO L93 Difference]: Finished difference Result 116 states and 182 transitions. [2019-11-24 06:05:04,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:04,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-24 06:05:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:04,499 INFO L225 Difference]: With dead ends: 116 [2019-11-24 06:05:04,499 INFO L226 Difference]: Without dead ends: 69 [2019-11-24 06:05:04,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 06:05:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-24 06:05:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2019-11-24 06:05:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-24 06:05:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2019-11-24 06:05:04,555 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 18 [2019-11-24 06:05:04,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:04,556 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2019-11-24 06:05:04,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2019-11-24 06:05:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-24 06:05:04,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:04,559 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:04,560 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:04,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash 399273191, now seen corresponding path program 1 times [2019-11-24 06:05:04,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:04,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63999296] [2019-11-24 06:05:04,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:04,627 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-24 06:05:04,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63999296] [2019-11-24 06:05:04,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:04,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:04,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317415188] [2019-11-24 06:05:04,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:04,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:04,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:04,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:04,631 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand 3 states. [2019-11-24 06:05:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:04,675 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-11-24 06:05:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:04,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-24 06:05:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:04,678 INFO L225 Difference]: With dead ends: 188 [2019-11-24 06:05:04,679 INFO L226 Difference]: Without dead ends: 124 [2019-11-24 06:05:04,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 06:05:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-24 06:05:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-11-24 06:05:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-24 06:05:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2019-11-24 06:05:04,699 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 19 [2019-11-24 06:05:04,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:04,699 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2019-11-24 06:05:04,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2019-11-24 06:05:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-24 06:05:04,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:04,701 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] [2019-11-24 06:05:04,702 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:04,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:04,702 INFO L82 PathProgramCache]: Analyzing trace with hash 825380010, now seen corresponding path program 1 times [2019-11-24 06:05:04,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:04,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480451394] [2019-11-24 06:05:04,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:04,743 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-24 06:05:04,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480451394] [2019-11-24 06:05:04,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:04,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:04,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581414083] [2019-11-24 06:05:04,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:04,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:04,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:04,746 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand 3 states. [2019-11-24 06:05:04,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:04,828 INFO L93 Difference]: Finished difference Result 290 states and 424 transitions. [2019-11-24 06:05:04,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:04,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-24 06:05:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:04,831 INFO L225 Difference]: With dead ends: 290 [2019-11-24 06:05:04,831 INFO L226 Difference]: Without dead ends: 171 [2019-11-24 06:05:04,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 06:05:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-24 06:05:04,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2019-11-24 06:05:04,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-24 06:05:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2019-11-24 06:05:04,872 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 20 [2019-11-24 06:05:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:04,872 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2019-11-24 06:05:04,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:04,872 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2019-11-24 06:05:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-24 06:05:04,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:04,874 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-24 06:05:04,875 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1487374559, now seen corresponding path program 1 times [2019-11-24 06:05:04,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:04,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056649197] [2019-11-24 06:05:04,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-24 06:05:04,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056649197] [2019-11-24 06:05:04,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:04,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:04,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808320595] [2019-11-24 06:05:04,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:04,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:04,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:04,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:04,958 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand 4 states. [2019-11-24 06:05:05,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:05,041 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2019-11-24 06:05:05,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:05,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-24 06:05:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:05,043 INFO L225 Difference]: With dead ends: 381 [2019-11-24 06:05:05,043 INFO L226 Difference]: Without dead ends: 227 [2019-11-24 06:05:05,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-24 06:05:05,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 195. [2019-11-24 06:05:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-24 06:05:05,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 273 transitions. [2019-11-24 06:05:05,065 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 273 transitions. Word has length 28 [2019-11-24 06:05:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:05,065 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 273 transitions. [2019-11-24 06:05:05,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 273 transitions. [2019-11-24 06:05:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-24 06:05:05,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:05,067 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] [2019-11-24 06:05:05,068 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:05,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:05,068 INFO L82 PathProgramCache]: Analyzing trace with hash 596937378, now seen corresponding path program 1 times [2019-11-24 06:05:05,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:05,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719740571] [2019-11-24 06:05:05,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:05,114 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-24 06:05:05,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719740571] [2019-11-24 06:05:05,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:05,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-24 06:05:05,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134421562] [2019-11-24 06:05:05,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:05,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:05,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:05,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:05,119 INFO L87 Difference]: Start difference. First operand 195 states and 273 transitions. Second operand 3 states. [2019-11-24 06:05:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:05,157 INFO L93 Difference]: Finished difference Result 405 states and 564 transitions. [2019-11-24 06:05:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:05,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-24 06:05:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:05,159 INFO L225 Difference]: With dead ends: 405 [2019-11-24 06:05:05,159 INFO L226 Difference]: Without dead ends: 230 [2019-11-24 06:05:05,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 06:05:05,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-24 06:05:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-24 06:05:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-24 06:05:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 314 transitions. [2019-11-24 06:05:05,179 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 314 transitions. Word has length 31 [2019-11-24 06:05:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:05,179 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 314 transitions. [2019-11-24 06:05:05,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 314 transitions. [2019-11-24 06:05:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 06:05:05,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:05,182 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] [2019-11-24 06:05:05,182 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:05,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1740463147, now seen corresponding path program 1 times [2019-11-24 06:05:05,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:05,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242854014] [2019-11-24 06:05:05,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:05,251 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-24 06:05:05,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242854014] [2019-11-24 06:05:05,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:05,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:05,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921426965] [2019-11-24 06:05:05,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:05,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:05,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:05,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:05,255 INFO L87 Difference]: Start difference. First operand 230 states and 314 transitions. Second operand 3 states. [2019-11-24 06:05:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:05,287 INFO L93 Difference]: Finished difference Result 417 states and 573 transitions. [2019-11-24 06:05:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:05,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-24 06:05:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:05,290 INFO L225 Difference]: With dead ends: 417 [2019-11-24 06:05:05,290 INFO L226 Difference]: Without dead ends: 220 [2019-11-24 06:05:05,291 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-24 06:05:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-24 06:05:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 199. [2019-11-24 06:05:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-24 06:05:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 259 transitions. [2019-11-24 06:05:05,305 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 259 transitions. Word has length 32 [2019-11-24 06:05:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:05,306 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 259 transitions. [2019-11-24 06:05:05,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 259 transitions. [2019-11-24 06:05:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-24 06:05:05,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:05,308 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] [2019-11-24 06:05:05,308 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:05,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1395637900, now seen corresponding path program 1 times [2019-11-24 06:05:05,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:05,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335768431] [2019-11-24 06:05:05,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:05,386 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-24 06:05:05,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335768431] [2019-11-24 06:05:05,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:05,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:05,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640922690] [2019-11-24 06:05:05,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:05,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:05,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:05,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:05,390 INFO L87 Difference]: Start difference. First operand 199 states and 259 transitions. Second operand 4 states. [2019-11-24 06:05:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:05,421 INFO L93 Difference]: Finished difference Result 219 states and 283 transitions. [2019-11-24 06:05:05,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:05,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-24 06:05:05,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:05,423 INFO L225 Difference]: With dead ends: 219 [2019-11-24 06:05:05,423 INFO L226 Difference]: Without dead ends: 217 [2019-11-24 06:05:05,424 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-24 06:05:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-11-24 06:05:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-11-24 06:05:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-11-24 06:05:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 256 transitions. [2019-11-24 06:05:05,440 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 256 transitions. Word has length 32 [2019-11-24 06:05:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:05,442 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 256 transitions. [2019-11-24 06:05:05,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 256 transitions. [2019-11-24 06:05:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-24 06:05:05,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:05,445 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] [2019-11-24 06:05:05,446 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash 315090371, now seen corresponding path program 1 times [2019-11-24 06:05:05,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:05,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360421970] [2019-11-24 06:05:05,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:05,587 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-24 06:05:05,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360421970] [2019-11-24 06:05:05,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738691100] [2019-11-24 06:05:05,588 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-24 06:05:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:05,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 06:05:05,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:05,715 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-24 06:05:05,715 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:05,729 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-24 06:05:05,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1445776353] [2019-11-24 06:05:05,764 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2019-11-24 06:05:05,764 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 06:05:05,777 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 06:05:05,791 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 06:05:05,792 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 06:05:06,279 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 06:05:06,587 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 42 [2019-11-24 06:05:06,767 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-11-24 06:05:06,916 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-11-24 06:05:07,434 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 83 [2019-11-24 06:05:07,788 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-11-24 06:05:08,116 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 60 [2019-11-24 06:05:08,460 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-11-24 06:05:08,810 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-11-24 06:05:09,226 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2019-11-24 06:05:09,634 WARN L192 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 76 [2019-11-24 06:05:10,039 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-11-24 06:05:10,574 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2019-11-24 06:05:10,904 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2019-11-24 06:05:11,251 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2019-11-24 06:05:11,631 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 74 [2019-11-24 06:05:12,031 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-11-24 06:05:12,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 06:05:12,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [3, 4, 3] total 24 [2019-11-24 06:05:12,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958545264] [2019-11-24 06:05:12,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-24 06:05:12,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:12,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-24 06:05:12,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-11-24 06:05:12,112 INFO L87 Difference]: Start difference. First operand 197 states and 256 transitions. Second operand 20 states. [2019-11-24 06:05:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:13,026 INFO L93 Difference]: Finished difference Result 360 states and 471 transitions. [2019-11-24 06:05:13,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-24 06:05:13,026 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2019-11-24 06:05:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:13,028 INFO L225 Difference]: With dead ends: 360 [2019-11-24 06:05:13,028 INFO L226 Difference]: Without dead ends: 164 [2019-11-24 06:05:13,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 12 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-11-24 06:05:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-24 06:05:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2019-11-24 06:05:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-24 06:05:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 200 transitions. [2019-11-24 06:05:13,046 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 200 transitions. Word has length 33 [2019-11-24 06:05:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:13,046 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 200 transitions. [2019-11-24 06:05:13,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-24 06:05:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 200 transitions. [2019-11-24 06:05:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 06:05:13,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:13,049 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:13,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:13,255 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:13,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1243997965, now seen corresponding path program 1 times [2019-11-24 06:05:13,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:13,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287159552] [2019-11-24 06:05:13,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:13,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287159552] [2019-11-24 06:05:13,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:13,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:13,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810889672] [2019-11-24 06:05:13,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:13,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:13,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:13,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:13,299 INFO L87 Difference]: Start difference. First operand 158 states and 200 transitions. Second operand 3 states. [2019-11-24 06:05:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:13,314 INFO L93 Difference]: Finished difference Result 255 states and 330 transitions. [2019-11-24 06:05:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:13,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 06:05:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:13,316 INFO L225 Difference]: With dead ends: 255 [2019-11-24 06:05:13,316 INFO L226 Difference]: Without dead ends: 158 [2019-11-24 06:05:13,317 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-24 06:05:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-24 06:05:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-24 06:05:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-24 06:05:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 198 transitions. [2019-11-24 06:05:13,327 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 198 transitions. Word has length 41 [2019-11-24 06:05:13,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:13,327 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 198 transitions. [2019-11-24 06:05:13,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 198 transitions. [2019-11-24 06:05:13,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-24 06:05:13,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:13,328 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:13,329 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:13,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1449943148, now seen corresponding path program 1 times [2019-11-24 06:05:13,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:13,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233069310] [2019-11-24 06:05:13,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:13,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:13,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233069310] [2019-11-24 06:05:13,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:13,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:13,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303788629] [2019-11-24 06:05:13,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:13,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:13,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:13,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:13,376 INFO L87 Difference]: Start difference. First operand 158 states and 198 transitions. Second operand 3 states. [2019-11-24 06:05:13,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:13,399 INFO L93 Difference]: Finished difference Result 247 states and 315 transitions. [2019-11-24 06:05:13,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:13,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-24 06:05:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:13,400 INFO L225 Difference]: With dead ends: 247 [2019-11-24 06:05:13,401 INFO L226 Difference]: Without dead ends: 140 [2019-11-24 06:05:13,403 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-24 06:05:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-24 06:05:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2019-11-24 06:05:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-24 06:05:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2019-11-24 06:05:13,413 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 41 [2019-11-24 06:05:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:13,413 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2019-11-24 06:05:13,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2019-11-24 06:05:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-24 06:05:13,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:13,415 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-24 06:05:13,416 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:13,416 INFO L82 PathProgramCache]: Analyzing trace with hash -123334937, now seen corresponding path program 1 times [2019-11-24 06:05:13,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:13,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019590701] [2019-11-24 06:05:13,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:13,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019590701] [2019-11-24 06:05:13,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173980724] [2019-11-24 06:05:13,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:13,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-24 06:05:13,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-24 06:05:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:13,680 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-24 06:05:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-24 06:05:13,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1248346512] [2019-11-24 06:05:13,709 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2019-11-24 06:05:13,709 INFO L166 IcfgInterpreter]: Building call graph [2019-11-24 06:05:13,710 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-24 06:05:13,710 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-24 06:05:13,710 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-24 06:05:15,596 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-24 06:05:15,974 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 61 [2019-11-24 06:05:16,407 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2019-11-24 06:05:16,852 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-11-24 06:05:17,544 WARN L192 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 96 [2019-11-24 06:05:18,259 WARN L192 SmtUtils]: Spent 651.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 84 [2019-11-24 06:05:18,760 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 85 [2019-11-24 06:05:19,070 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 57 [2019-11-24 06:05:19,476 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-11-24 06:05:20,331 WARN L192 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 94 [2019-11-24 06:05:20,916 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 75 [2019-11-24 06:05:21,431 WARN L192 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-11-24 06:05:21,991 WARN L192 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 81 [2019-11-24 06:05:22,473 WARN L192 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 71 [2019-11-24 06:05:22,969 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 73 [2019-11-24 06:05:23,465 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 76 [2019-11-24 06:05:23,911 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 79 [2019-11-24 06:05:24,295 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2019-11-24 06:05:24,718 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2019-11-24 06:05:25,128 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 72 [2019-11-24 06:05:25,634 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 74 [2019-11-24 06:05:26,124 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 78 [2019-11-24 06:05:26,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-24 06:05:26,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [3, 4, 3] total 28 [2019-11-24 06:05:26,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843971393] [2019-11-24 06:05:26,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-24 06:05:26,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:26,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-24 06:05:26,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2019-11-24 06:05:26,233 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand 24 states. [2019-11-24 06:05:26,841 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 71 [2019-11-24 06:05:27,263 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 52 [2019-11-24 06:05:27,832 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-24 06:05:28,667 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-11-24 06:05:29,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,337 INFO L93 Difference]: Finished difference Result 276 states and 338 transitions. [2019-11-24 06:05:29,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-24 06:05:29,337 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-11-24 06:05:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,339 INFO L225 Difference]: With dead ends: 276 [2019-11-24 06:05:29,339 INFO L226 Difference]: Without dead ends: 165 [2019-11-24 06:05:29,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 90 SyntacticMatches, 11 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056 [2019-11-24 06:05:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-24 06:05:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 147. [2019-11-24 06:05:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-24 06:05:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2019-11-24 06:05:29,356 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 42 [2019-11-24 06:05:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,357 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2019-11-24 06:05:29,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-24 06:05:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2019-11-24 06:05:29,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-24 06:05:29,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,360 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-24 06:05:29,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-24 06:05:29,564 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash 65864487, now seen corresponding path program 1 times [2019-11-24 06:05:29,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452313181] [2019-11-24 06:05:29,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:29,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452313181] [2019-11-24 06:05:29,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:29,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:29,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232538024] [2019-11-24 06:05:29,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:29,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:29,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:29,604 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 3 states. [2019-11-24 06:05:29,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,621 INFO L93 Difference]: Finished difference Result 224 states and 267 transitions. [2019-11-24 06:05:29,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:29,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-24 06:05:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,623 INFO L225 Difference]: With dead ends: 224 [2019-11-24 06:05:29,623 INFO L226 Difference]: Without dead ends: 147 [2019-11-24 06:05:29,624 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-24 06:05:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-24 06:05:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-11-24 06:05:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-24 06:05:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 171 transitions. [2019-11-24 06:05:29,636 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 171 transitions. Word has length 64 [2019-11-24 06:05:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,636 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 171 transitions. [2019-11-24 06:05:29,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 171 transitions. [2019-11-24 06:05:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-24 06:05:29,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,638 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] [2019-11-24 06:05:29,638 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1443378950, now seen corresponding path program 1 times [2019-11-24 06:05:29,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505004220] [2019-11-24 06:05:29,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-24 06:05:29,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505004220] [2019-11-24 06:05:29,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:29,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:29,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48867176] [2019-11-24 06:05:29,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:29,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:29,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:29,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:29,707 INFO L87 Difference]: Start difference. First operand 147 states and 171 transitions. Second operand 4 states. [2019-11-24 06:05:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,740 INFO L93 Difference]: Finished difference Result 288 states and 337 transitions. [2019-11-24 06:05:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:29,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-24 06:05:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,742 INFO L225 Difference]: With dead ends: 288 [2019-11-24 06:05:29,742 INFO L226 Difference]: Without dead ends: 286 [2019-11-24 06:05:29,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-24 06:05:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 211. [2019-11-24 06:05:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-24 06:05:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2019-11-24 06:05:29,759 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 65 [2019-11-24 06:05:29,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,759 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2019-11-24 06:05:29,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2019-11-24 06:05:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-24 06:05:29,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,760 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2019-11-24 06:05:29,760 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1909862367, now seen corresponding path program 2 times [2019-11-24 06:05:29,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186215460] [2019-11-24 06:05:29,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-24 06:05:29,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186215460] [2019-11-24 06:05:29,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:29,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-24 06:05:29,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704554968] [2019-11-24 06:05:29,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-24 06:05:29,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:29,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-24 06:05:29,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-24 06:05:29,801 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand 3 states. [2019-11-24 06:05:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,828 INFO L93 Difference]: Finished difference Result 400 states and 477 transitions. [2019-11-24 06:05:29,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-24 06:05:29,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-11-24 06:05:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,831 INFO L225 Difference]: With dead ends: 400 [2019-11-24 06:05:29,831 INFO L226 Difference]: Without dead ends: 211 [2019-11-24 06:05:29,832 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-24 06:05:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-24 06:05:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-11-24 06:05:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-11-24 06:05:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 247 transitions. [2019-11-24 06:05:29,848 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 247 transitions. Word has length 75 [2019-11-24 06:05:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,848 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 247 transitions. [2019-11-24 06:05:29,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-24 06:05:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 247 transitions. [2019-11-24 06:05:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-24 06:05:29,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-24 06:05:29,852 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-24 06:05:29,852 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-24 06:05:29,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-24 06:05:29,852 INFO L82 PathProgramCache]: Analyzing trace with hash -606583533, now seen corresponding path program 1 times [2019-11-24 06:05:29,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-24 06:05:29,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047004171] [2019-11-24 06:05:29,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-24 06:05:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-24 06:05:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-24 06:05:29,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047004171] [2019-11-24 06:05:29,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-24 06:05:29,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-24 06:05:29,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861631297] [2019-11-24 06:05:29,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-24 06:05:29,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-24 06:05:29,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-24 06:05:29,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:29,900 INFO L87 Difference]: Start difference. First operand 211 states and 247 transitions. Second operand 4 states. [2019-11-24 06:05:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-24 06:05:29,936 INFO L93 Difference]: Finished difference Result 275 states and 325 transitions. [2019-11-24 06:05:29,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-24 06:05:29,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-24 06:05:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-24 06:05:29,937 INFO L225 Difference]: With dead ends: 275 [2019-11-24 06:05:29,937 INFO L226 Difference]: Without dead ends: 0 [2019-11-24 06:05:29,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-24 06:05:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-24 06:05:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-24 06:05:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-24 06:05:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-24 06:05:29,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2019-11-24 06:05:29,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-24 06:05:29,939 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-24 06:05:29,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-24 06:05:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-24 06:05:29,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-24 06:05:29,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-24 06:05:30,551 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-11-24 06:05:31,872 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 143 DAG size of output: 113 [2019-11-24 06:05:32,241 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-11-24 06:05:32,829 WARN L192 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-11-24 06:05:33,351 WARN L192 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 91 [2019-11-24 06:05:34,742 WARN L192 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 126 DAG size of output: 109 [2019-11-24 06:05:35,100 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 82 [2019-11-24 06:05:35,641 WARN L192 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2019-11-24 06:05:35,804 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 35 [2019-11-24 06:05:37,072 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 155 DAG size of output: 113 [2019-11-24 06:05:37,467 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2019-11-24 06:05:37,530 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-24 06:05:37,531 INFO L444 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2019-11-24 06:05:37,531 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2019-11-24 06:05:37,531 INFO L444 ceAbstractionStarter]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2019-11-24 06:05:37,531 INFO L447 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-24 06:05:37,531 INFO L444 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2019-11-24 06:05:37,532 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2019-11-24 06:05:37,532 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-11-24 06:05:37,532 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2019-11-24 06:05:37,532 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2019-11-24 06:05:37,532 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2019-11-24 06:05:37,533 INFO L440 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse25 (= ~a_t~0 0)) (.cse5 (<= ULTIMATE.start_eval_~tmp___0~1 2147483647)) (.cse28 (= |ULTIMATE.start_is_do_read_c_triggered_#res| ULTIMATE.start_immediate_notify_threads_~tmp___0~0)) (.cse8 (= ~c_last_read~0 0)) (.cse26 (= 1 ~p_dw_st~0)) (.cse23 (= ~c_dr_st~0 0)) (.cse11 (<= 1 ~c_dr_i~0)) (.cse24 (= ~q_write_ev~0 2)) (.cse12 (= ULTIMATE.start_do_read_c_~a~0 ~a_t~0)) (.cse29 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse0 (<= ULTIMATE.start_eval_~tmp~1 2147483647)) (.cse30 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|)) (.cse14 (not (= 0 ULTIMATE.start_eval_~tmp___0~1))) (.cse31 (<= 0 (+ ~q_buf_0~0 2147483648))) (.cse17 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse18 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1)) (.cse20 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse21 (<= 0 (+ ULTIMATE.start_eval_~tmp___0~1 2147483648))) (.cse32 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse33 (= ~q_read_ev~0 2)) (.cse34 (<= ~q_buf_0~0 2147483647)) (.cse2 (not (= ULTIMATE.start_eval_~tmp~1 0))) (.cse4 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse35 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse9 (= 0 ~p_dw_pc~0)) (.cse10 (= ~c_num_read~0 0)) (.cse13 (<= ~c_dr_i~0 1)) (.cse1 (<= 0 (+ ULTIMATE.start_eval_~tmp~1 2147483648))) (.cse37 (= 1 ~p_num_write~0)) (.cse16 (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse19 (= ~p_dw_i~0 1)) (.cse36 (= 0 ~q_free~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (<= 2 ~q_read_ev~0)) (.cse27 (= ~p_last_write~0 ~q_buf_0~0))) (or (and .cse0 .cse1 .cse2 (let ((.cse15 (= 1 ~q_free~0)) (.cse22 (= 0 ~p_num_write~0))) (or (and .cse3 .cse4 .cse5 .cse6 (= 0 ~q_buf_0~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~q_write_ev~0 2) .cse14 .cse15 (<= ~q_read_ev~0 2) (= ~c_dr_st~0 2) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse4 .cse8 .cse9 (= 0 ~p_last_write~0) .cse23 (= 1 ~c_dr_i~0) .cse10 (= ~q_write_ev~0 ~q_read_ev~0) .cse24 (= 1 ULTIMATE.start_start_simulation_~kernel_st~0) .cse25 .cse15 (= ~c_dr_pc~0 0) .cse17 .cse19 .cse20 .cse22))) .cse26 .cse27) (and (<= 0 ~c_last_read~0) (<= ~p_dw_i~0 1) (<= 1 ~p_dw_i~0) .cse28 .cse26 .cse23 (<= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) .cse11 .cse24 .cse29 .cse0 .cse30 .cse31 .cse18 .cse20 .cse32 .cse33 .cse34 .cse2 .cse4 .cse35 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse9 .cse27 (<= ~c_dr_pc~0 0) (<= 0 ~c_dr_pc~0) .cse10 .cse13 .cse36 .cse1 .cse37 .cse25 .cse16 (<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2) (<= ~c_last_read~0 0)) (and .cse5 .cse6 .cse28 .cse8 .cse26 .cse23 .cse11 .cse24 .cse12 .cse29 .cse0 .cse30 .cse14 .cse31 .cse17 .cse18 .cse20 .cse21 .cse32 .cse33 .cse34 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 1) .cse2 .cse4 .cse35 .cse9 .cse27 .cse10 .cse13 .cse36 .cse1 .cse37 .cse16 .cse19) (let ((.cse38 (+ ~c_num_read~0 1))) (and (<= .cse38 ~p_num_write~0) .cse36 .cse3 (<= ~p_num_write~0 .cse38) .cse6 .cse7 .cse27 (= 1 ~p_dw_pc~0))))) [2019-11-24 06:05:37,534 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-24 06:05:37,534 INFO L444 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2019-11-24 06:05:37,534 INFO L444 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-11-24 06:05:37,534 INFO L444 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-11-24 06:05:37,534 INFO L440 ceAbstractionStarter]: At program point L142(lines 142 146) 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) (<= 2 ~q_write_ev~0) (<= ~p_num_write~0 .cse0) (= ~c_dr_pc~0 1) (<= 2 ~q_read_ev~0) (not (= ~c_dr_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (= 1 ~p_dw_pc~0))) [2019-11-24 06:05:37,535 INFO L440 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse0 (<= 2 ~q_write_ev~0)) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse12 (= ~p_last_write~0 ~q_buf_0~0))) (or (and (<= 0 (+ ULTIMATE.start_eval_~tmp~1 2147483648)) (<= ULTIMATE.start_eval_~tmp~1 2147483647) (not (= ULTIMATE.start_eval_~tmp~1 0)) (let ((.cse1 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse4 (= ~c_last_read~0 0)) (.cse5 (= 0 ~p_dw_pc~0)) (.cse6 (= ~c_num_read~0 0)) (.cse7 (= 1 ~q_free~0)) (.cse8 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse11 (= 0 ~p_num_write~0))) (or (and .cse0 .cse1 (<= ULTIMATE.start_eval_~tmp___0~1 2147483647) .cse2 (= 0 ~q_buf_0~0) .cse3 .cse4 .cse5 .cse6 (<= 1 ~c_dr_i~0) (= ULTIMATE.start_do_read_c_~a~0 ~a_t~0) (<= ~c_dr_i~0 1) (<= ~q_write_ev~0 2) (not (= 0 ULTIMATE.start_eval_~tmp___0~1)) .cse7 (<= ~q_read_ev~0 2) (= ~c_dr_st~0 2) (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0) .cse8 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1) .cse9 .cse10 (<= 0 (+ ULTIMATE.start_eval_~tmp___0~1 2147483648)) .cse11) (and .cse1 .cse4 .cse5 (= 0 ~p_last_write~0) (= ~c_dr_st~0 0) (= 1 ~c_dr_i~0) .cse6 (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_write_ev~0 2) (= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~a_t~0 0) .cse7 (= ~c_dr_pc~0 0) .cse8 .cse9 .cse10 .cse11))) .cse12 (= 1 ~p_dw_st~0)) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (not (= 0 ~p_dw_st~0)) .cse0 .cse2 .cse3 .cse12 (= 1 ~p_dw_pc~0)))) [2019-11-24 06:05:37,535 INFO L440 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (<= 0 ~c_last_read~0)) (.cse1 (<= ~p_dw_i~0 1)) (.cse2 (<= 1 ~p_dw_i~0)) (.cse27 (= ~c_dr_pc~0 1)) (.cse3 (= 1 ~p_dw_st~0)) (.cse4 (<= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse5 (<= 1 ~c_dr_i~0)) (.cse6 (<= ULTIMATE.start_eval_~tmp~1 2147483647)) (.cse7 (<= 0 (+ ~q_buf_0~0 2147483648))) (.cse8 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1)) (.cse9 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse10 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse11 (= ~q_read_ev~0 2)) (.cse12 (<= ~q_buf_0~0 2147483647)) (.cse14 (= ~q_write_ev~0 1)) (.cse13 (not (= ULTIMATE.start_eval_~tmp~1 0))) (.cse15 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse16 (= 0 ~p_dw_pc~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= ~c_num_read~0 0)) (.cse20 (= 0 ~q_free~0)) (.cse19 (<= ~c_dr_i~0 1)) (.cse21 (<= 0 (+ ULTIMATE.start_eval_~tmp~1 2147483648))) (.cse22 (= 1 ~p_num_write~0)) (.cse23 (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse24 (<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2)) (.cse25 (<= ~c_last_read~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= ~c_dr_pc~0 0) (<= 0 ~c_dr_pc~0) .cse18 .cse19 .cse20 .cse21 .cse22 (= ~a_t~0 0) .cse23 .cse24 .cse25) (let ((.cse26 (+ ~c_num_read~0 1))) (and (<= .cse26 ~p_num_write~0) .cse20 (not (= 0 ~p_dw_st~0)) (<= ~p_num_write~0 .cse26) .cse27 (<= 2 ~q_read_ev~0) .cse17 (= 1 ~p_dw_pc~0))) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_eval_~tmp___0~1 2147483647) .cse27 .cse3 .cse4 .cse5 (= ULTIMATE.start_do_read_c_~a~0 ~a_t~0) .cse6 (not (= 0 ULTIMATE.start_eval_~tmp___0~1)) .cse7 .cse8 .cse9 (<= 0 (+ ULTIMATE.start_eval_~tmp___0~1 2147483648)) .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse19 .cse21 .cse22 (= ~c_dr_st~0 2) .cse23 .cse24 .cse25))) [2019-11-24 06:05:37,535 INFO L440 ceAbstractionStarter]: At program point L43-1(lines 31 45) the Hoare annotation is: (let ((.cse2 (= 1 ~q_free~0)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse3 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_last_read~0 ~p_last_write~0))) (or (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (<= 2 ~p_dw_st~0) .cse0 .cse1 (= ~c_dr_pc~0 1) .cse2 (not (= ~c_dr_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) .cse3) (and (<= ~p_dw_i~0 1) (<= 1 ~p_dw_i~0) (<= ULTIMATE.start_eval_~tmp___0~1 2147483647) (= ~c_dr_st~0 1) (= ~c_num_read~0 1) (<= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) (<= 1 ~c_dr_i~0) (<= ULTIMATE.start_eval_~tmp~1 2147483647) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (not (= 0 ULTIMATE.start_eval_~tmp___0~1)) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse2 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1) (= ~q_read_ev~0 1) (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|) (<= 0 (+ ULTIMATE.start_eval_~tmp___0~1 2147483648)) (<= ~q_buf_0~0 2147483647) (not (= ULTIMATE.start_eval_~tmp~1 0)) .cse0 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (<= ~c_dr_pc~0 0) .cse3 (<= 0 ~c_dr_pc~0) (= ULTIMATE.start_do_read_c_~a~0 ~c_last_read~0) (<= ~c_dr_i~0 1) (= ULTIMATE.start_do_read_c_~a~0 ~q_buf_0~0) (<= 0 (+ ULTIMATE.start_eval_~tmp~1 2147483648)) (= 2 ~p_dw_st~0) (<= ~q_write_ev~0 2) (= 1 ~p_num_write~0) .cse1 (= ~a_t~0 0) (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2) (= 1 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)))) [2019-11-24 06:05:37,535 INFO L440 ceAbstractionStarter]: At program point L10-1(lines 138 190) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_eval_~tmp___0~1 2147483647)) (.cse1 (= ~c_dr_st~0 1)) (.cse2 (<= 1 ~c_dr_i~0)) (.cse4 (not (= 0 ULTIMATE.start_eval_~tmp___0~1))) (.cse6 (<= ~q_read_ev~0 2)) (.cse7 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1)) (.cse8 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse9 (<= 0 (+ ULTIMATE.start_eval_~tmp___0~1 2147483648))) (.cse3 (= ULTIMATE.start_eval_~tmp~1 0)) (.cse11 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse14 (<= ~c_dr_i~0 1)) (.cse15 (<= ~q_write_ev~0 2)) (.cse17 (= ~a_t~0 0)) (.cse18 (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse19 (= ~p_dw_i~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= 1 ~q_free~0)) (.cse12 (<= 2 ~q_read_ev~0)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= 1 ~p_dw_pc~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~c_dr_pc~0 0) (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~q_buf_0~0) .cse12 (= 0 ~p_dw_st~0) (= 0 ~p_dw_pc~0) .cse13 (= ~c_num_read~0 0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= 0 ~p_num_write~0)) (and .cse0 (= |ULTIMATE.start_is_do_read_c_triggered_#res| ULTIMATE.start_immediate_notify_threads_~tmp___0~0) (= ~c_last_read~0 0) .cse1 (<= ~c_num_read~0 0) (<= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) .cse2 (<= ULTIMATE.start_eval_~tmp~1 2147483647) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) .cse4 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse6 .cse7 .cse8 .cse9 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0) (<= ~q_buf_0~0 2147483647) (not .cse3) .cse10 .cse11 (<= 0 ~c_num_read~0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse13 (<= ~c_dr_pc~0 0) .cse20 (<= 0 ~c_dr_pc~0) .cse14 (= 0 ~q_free~0) (<= 0 (+ ULTIMATE.start_eval_~tmp~1 2147483648)) (= 2 ~p_dw_st~0) (= 0 ULTIMATE.start_immediate_notify_threads_~tmp~0) .cse15 (= 1 ~p_num_write~0) .cse17 .cse18 (<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2) .cse19) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse16 .cse5 .cse12 .cse13 .cse20))) [2019-11-24 06:05:37,536 INFO L444 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-11-24 06:05:37,536 INFO L444 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2019-11-24 06:05:37,536 INFO L447 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2019-11-24 06:05:37,536 INFO L440 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (<= 0 ~c_last_read~0)) (.cse1 (<= ~p_dw_i~0 1)) (.cse2 (<= 1 ~p_dw_i~0)) (.cse29 (= ~c_dr_pc~0 1)) (.cse3 (= 1 ~p_dw_st~0)) (.cse4 (<= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse5 (<= 1 ~c_dr_i~0)) (.cse6 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse7 (<= ULTIMATE.start_eval_~tmp~1 2147483647)) (.cse8 (<= 0 (+ ~q_buf_0~0 2147483648))) (.cse9 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1)) (.cse10 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse11 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (.cse12 (= ~q_read_ev~0 2)) (.cse13 (<= ~q_buf_0~0 2147483647)) (.cse14 (not (= ULTIMATE.start_eval_~tmp~1 0))) (.cse15 (= ~q_write_ev~0 1)) (.cse16 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse17 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse18 (= 0 ~p_dw_pc~0)) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~c_num_read~0 0)) (.cse21 (<= ~c_dr_i~0 1)) (.cse22 (= 0 ~q_free~0)) (.cse23 (<= 0 (+ ULTIMATE.start_eval_~tmp~1 2147483648))) (.cse24 (= 1 ~p_num_write~0)) (.cse25 (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse26 (<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2)) (.cse27 (<= ~c_last_read~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_dr_st~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse18 .cse19 (<= ~c_dr_pc~0 0) (<= 0 ~c_dr_pc~0) .cse20 .cse21 .cse22 .cse23 .cse24 (= ~a_t~0 0) .cse25 .cse26 .cse27) (let ((.cse28 (+ ~c_num_read~0 1))) (and (<= .cse28 ~p_num_write~0) .cse22 (<= ~p_num_write~0 .cse28) .cse29 (<= 2 ~q_read_ev~0) .cse19 (= 1 ~p_dw_pc~0))) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_eval_~tmp___0~1 2147483647) .cse29 .cse3 .cse4 .cse5 (= ULTIMATE.start_do_read_c_~a~0 ~a_t~0) .cse6 .cse7 (not (= 0 ULTIMATE.start_eval_~tmp___0~1)) .cse8 .cse9 .cse10 (<= 0 (+ ULTIMATE.start_eval_~tmp___0~1 2147483648)) .cse11 .cse12 .cse13 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 1) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= ~c_dr_st~0 2) .cse25 .cse26 .cse27))) [2019-11-24 06:05:37,537 INFO L440 ceAbstractionStarter]: At program point L62-1(lines 50 64) the Hoare annotation is: (let ((.cse1 (<= 2 ~q_write_ev~0)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= 1 ~q_free~0)) (.cse2 (= 1 ~p_dw_pc~0))) (or (and (<= ~p_dw_i~0 1) (<= 1 ~p_dw_i~0) (<= ULTIMATE.start_eval_~tmp___0~1 2147483647) (= ~c_dr_st~0 1) (= ~c_num_read~0 1) (<= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) (<= 1 ~c_dr_i~0) (= ULTIMATE.start_immediate_notify_threads_~tmp~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (<= ULTIMATE.start_eval_~tmp~1 2147483647) (not (= 0 ULTIMATE.start_eval_~tmp___0~1)) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse0 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1) (= ~q_read_ev~0 1) (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|) (<= 0 (+ ULTIMATE.start_eval_~tmp___0~1 2147483648)) (<= ~q_buf_0~0 2147483647) (not (= ULTIMATE.start_eval_~tmp~1 0)) .cse1 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= 0 ~p_dw_st~0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (<= ~c_dr_pc~0 0) .cse2 (<= 0 ~c_dr_pc~0) (= ULTIMATE.start_do_read_c_~a~0 ~c_last_read~0) (<= ~c_dr_i~0 1) (= ULTIMATE.start_do_read_c_~a~0 ~q_buf_0~0) (<= 0 (+ ULTIMATE.start_eval_~tmp~1 2147483648)) (<= ~q_write_ev~0 2) (= 1 ~p_num_write~0) .cse3 (= ~a_t~0 0) (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0) (<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2) (= 1 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0)) (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse1 .cse3 (= ~c_dr_pc~0 1) .cse0 (not (= ~c_dr_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) .cse2))) [2019-11-24 06:05:37,537 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 104) no Hoare annotation was computed. [2019-11-24 06:05:37,537 INFO L440 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse3 (not (= ~c_dr_st~0 0))) (.cse6 (= 0 ~q_free~0)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse8 (+ ~c_num_read~0 1))) (and (<= .cse8 ~p_num_write~0) .cse6 .cse7 .cse0 (<= ~p_num_write~0 .cse8) .cse1 .cse2 .cse4 .cse5)))) [2019-11-24 06:05:37,537 INFO L440 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse9 (= ~c_dr_st~0 0))) (let ((.cse2 (not .cse9)) (.cse8 (= 0 ~p_last_write~0)) (.cse11 (= 1 ~q_free~0)) (.cse6 (= 0 ~p_dw_st~0)) (.cse7 (= 0 ~p_dw_pc~0)) (.cse13 (= 0 ~p_num_write~0)) (.cse16 (<= ULTIMATE.start_eval_~tmp___0~1 2147483647)) (.cse17 (= ~c_last_read~0 0)) (.cse18 (<= ~c_num_read~0 0)) (.cse19 (<= 1 ~c_dr_i~0)) (.cse21 (<= ~q_read_ev~0 2)) (.cse22 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1)) (.cse23 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse24 (<= 0 (+ ULTIMATE.start_eval_~tmp___0~1 2147483648))) (.cse20 (= ULTIMATE.start_eval_~tmp~1 0)) (.cse25 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse26 (<= 0 ~c_num_read~0)) (.cse27 (<= ~c_dr_i~0 1)) (.cse28 (<= ~q_write_ev~0 2)) (.cse10 (= ~a_t~0 0)) (.cse29 (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse12 (= ~p_dw_i~0 1)) (.cse14 (= 0 ~q_free~0)) (.cse15 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse4 .cse9 (= 1 ~c_dr_i~0) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_write_ev~0 2) (= ~c_last_read~0 ~p_last_write~0) (= 1 ULTIMATE.start_start_simulation_~kernel_st~0) .cse10 .cse11 (= ~c_dr_pc~0 0) .cse12 .cse13) (and .cse14 .cse15 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse16 .cse1 .cse17 .cse8 .cse18 .cse19 (= ULTIMATE.start_do_read_c_~a~0 ~a_t~0) .cse20 (not (= 0 ULTIMATE.start_eval_~tmp___0~1)) .cse11 .cse21 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) .cse22 .cse23 .cse24 .cse0 .cse25 .cse26 (= 0 ~q_buf_0~0) .cse3 .cse6 .cse7 .cse27 .cse28 (= ~c_dr_st~0 2) .cse29 .cse12 .cse13) (and .cse16 (= |ULTIMATE.start_is_do_read_c_triggered_#res| ULTIMATE.start_immediate_notify_threads_~tmp___0~0) .cse17 .cse9 .cse18 (<= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) .cse19 (<= ULTIMATE.start_eval_~tmp~1 2147483647) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse21 .cse22 .cse23 .cse24 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0) (<= ~q_buf_0~0 2147483647) (not .cse20) .cse0 .cse25 .cse26 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse4 (<= ~c_dr_pc~0 0) .cse5 (<= 0 ~c_dr_pc~0) .cse27 .cse14 (<= 0 (+ ULTIMATE.start_eval_~tmp~1 2147483648)) (= 2 ~p_dw_st~0) (= 0 ULTIMATE.start_immediate_notify_threads_~tmp~0) .cse28 (= 1 ~p_num_write~0) .cse10 .cse29 (<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2) .cse12) (let ((.cse30 (+ ~c_num_read~0 1))) (and (<= .cse30 ~p_num_write~0) .cse14 .cse15 .cse0 (<= ~p_num_write~0 .cse30) .cse1 .cse3 .cse4 .cse5))))) [2019-11-24 06:05:37,537 INFO L444 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2019-11-24 06:05:37,537 INFO L444 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2019-11-24 06:05:37,538 INFO L444 ceAbstractionStarter]: For program point L32-3(lines 32 41) no Hoare annotation was computed. [2019-11-24 06:05:37,538 INFO L444 ceAbstractionStarter]: For program point L32-5(lines 32 41) no Hoare annotation was computed. [2019-11-24 06:05:37,538 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-11-24 06:05:37,538 INFO L440 ceAbstractionStarter]: At program point L313-1(lines 192 325) the Hoare annotation is: (let ((.cse8 (= ~c_dr_st~0 0))) (let ((.cse3 (not .cse8)) (.cse6 (= 0 ~q_free~0)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (<= 2 ~q_read_ev~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= 0 ~p_dw_st~0) (= 0 ~p_dw_pc~0) (= 0 ~p_last_write~0) .cse4 .cse8 (= 1 ~c_dr_i~0) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_write_ev~0 2) (= ~c_last_read~0 ~p_last_write~0) (= ~a_t~0 0) (= 1 ~q_free~0) (= ~c_dr_pc~0 0) (= 0 ULTIMATE.start_start_simulation_~kernel_st~0) (= ~p_dw_i~0 1) (= 0 ~p_num_write~0)) (let ((.cse9 (+ ~c_num_read~0 1))) (and (<= .cse9 ~p_num_write~0) .cse6 .cse7 .cse0 (<= ~p_num_write~0 .cse9) .cse1 .cse2 .cse4 .cse5))))) [2019-11-24 06:05:37,539 INFO L440 ceAbstractionStarter]: At program point L247(lines 237 277) the Hoare annotation is: (let ((.cse9 (= ~c_dr_st~0 0))) (let ((.cse2 (not .cse9)) (.cse15 (= ULTIMATE.start_eval_~tmp~1 0)) (.cse18 (<= ~c_dr_i~0 1)) (.cse17 (<= 0 ~c_num_read~0)) (.cse10 (<= ~c_num_read~0 0)) (.cse11 (<= 1 ~c_dr_i~0)) (.cse16 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse8 (= ~c_last_read~0 0)) (.cse20 (= ~a_t~0 0)) (.cse22 (= ~p_dw_i~0 1)) (.cse14 (= ULTIMATE.start_eval_~tmp___1~0 |ULTIMATE.start_exists_runnable_thread_#res|)) (.cse19 (<= ~q_write_ev~0 2)) (.cse12 (<= ~q_read_ev~0 2)) (.cse21 (<= 1 ULTIMATE.start_start_simulation_~kernel_st~0)) (.cse13 (<= ULTIMATE.start_start_simulation_~kernel_st~0 1)) (.cse6 (= 0 ~q_free~0)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse0 (<= 2 ~q_write_ev~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= |ULTIMATE.start_is_do_read_c_triggered_#res| ULTIMATE.start_immediate_notify_threads_~tmp___0~0) .cse8 .cse9 .cse10 (<= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) .cse11 (<= ULTIMATE.start_eval_~tmp~1 2147483647) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 |ULTIMATE.start_is_do_read_c_triggered_#res|) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse12 .cse13 .cse14 (= 0 ULTIMATE.start_is_do_write_p_triggered_~__retres1~0) (<= ~q_buf_0~0 2147483647) (not .cse15) .cse0 .cse16 .cse17 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse4 (<= ~c_dr_pc~0 0) .cse5 (<= 0 ~c_dr_pc~0) .cse18 .cse6 (<= 0 (+ ULTIMATE.start_eval_~tmp~1 2147483648)) (= 2 ~p_dw_st~0) (= 0 ULTIMATE.start_immediate_notify_threads_~tmp~0) .cse19 (= 1 ~p_num_write~0) .cse20 .cse21 (<= 1 ULTIMATE.start_exists_runnable_thread_~__retres1~2) .cse22) (and .cse15 .cse18 (let ((.cse29 (= 0 ~p_dw_st~0))) (let ((.cse23 (= 0 ~q_buf_0~0)) (.cse24 (= 0 ~p_dw_pc~0)) (.cse25 (= 0 ~p_last_write~0)) (.cse26 (let ((.cse30 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse30 .cse9) (and .cse29 .cse30)))) (.cse27 (= 1 ~q_free~0)) (.cse28 (= 0 ~p_num_write~0))) (or (and .cse16 .cse17 (<= ULTIMATE.start_eval_~tmp___0~1 2147483647) .cse23 .cse1 .cse3 .cse8 .cse24 .cse25 .cse10 .cse11 (= ULTIMATE.start_do_read_c_~a~0 ~a_t~0) .cse26 (not (= 0 ULTIMATE.start_eval_~tmp___0~1)) .cse27 (= ~c_dr_st~0 2) .cse22 .cse14 (<= 0 (+ ULTIMATE.start_eval_~tmp___0~1 2147483648)) .cse28) (and .cse16 .cse23 .cse29 .cse8 .cse24 .cse25 .cse9 (= 1 ~c_dr_i~0) (= ~c_num_read~0 0) (= ~q_write_ev~0 ~q_read_ev~0) .cse26 .cse20 .cse27 (= ~c_dr_pc~0 0) .cse22 .cse14 .cse28)))) .cse0 .cse19 .cse12 .cse21 .cse13) (let ((.cse31 (+ ~c_num_read~0 1))) (and (<= .cse31 ~p_num_write~0) .cse6 .cse7 .cse0 (<= ~p_num_write~0 .cse31) .cse1 .cse3 .cse4 .cse5))))) [2019-11-24 06:05:37,539 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2019-11-24 06:05:37,539 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-11-24 06:05:37,539 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 33 38) no Hoare annotation was computed. [2019-11-24 06:05:37,539 INFO L444 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2019-11-24 06:05:37,539 INFO L444 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2019-11-24 06:05:37,539 INFO L444 ceAbstractionStarter]: For program point L51-3(lines 51 60) no Hoare annotation was computed. [2019-11-24 06:05:37,540 INFO L444 ceAbstractionStarter]: For program point L51-5(lines 51 60) no Hoare annotation was computed. [2019-11-24 06:05:37,540 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2019-11-24 06:05:37,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 06:05:37 BoogieIcfgContainer [2019-11-24 06:05:37,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-24 06:05:37,604 INFO L168 Benchmark]: Toolchain (without parser) took 34734.43 ms. Allocated memory was 144.7 MB in the beginning and 507.5 MB in the end (delta: 362.8 MB). Free memory was 102.6 MB in the beginning and 447.5 MB in the end (delta: -344.9 MB). Peak memory consumption was 379.7 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:37,605 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-24 06:05:37,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.82 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 102.2 MB in the beginning and 181.4 MB in the end (delta: -79.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:37,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.04 ms. Allocated memory is still 202.9 MB. Free memory was 181.4 MB in the beginning and 179.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:37,606 INFO L168 Benchmark]: Boogie Preprocessor took 42.93 ms. Allocated memory is still 202.9 MB. Free memory was 179.3 MB in the beginning and 177.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:37,607 INFO L168 Benchmark]: RCFGBuilder took 697.35 ms. Allocated memory is still 202.9 MB. Free memory was 177.3 MB in the beginning and 131.7 MB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:37,608 INFO L168 Benchmark]: TraceAbstraction took 33504.37 ms. Allocated memory was 202.9 MB in the beginning and 507.5 MB in the end (delta: 304.6 MB). Free memory was 131.0 MB in the beginning and 447.5 MB in the end (delta: -316.5 MB). Peak memory consumption was 349.9 MB. Max. memory is 7.1 GB. [2019-11-24 06:05:37,610 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.28 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 437.82 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 102.2 MB in the beginning and 181.4 MB in the end (delta: -79.2 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.04 ms. Allocated memory is still 202.9 MB. Free memory was 181.4 MB in the beginning and 179.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.93 ms. Allocated memory is still 202.9 MB. Free memory was 179.3 MB in the beginning and 177.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 697.35 ms. Allocated memory is still 202.9 MB. Free memory was 177.3 MB in the beginning and 131.7 MB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33504.37 ms. Allocated memory was 202.9 MB in the beginning and 507.5 MB in the end (delta: 304.6 MB). Free memory was 131.0 MB in the beginning and 447.5 MB in the end (delta: -316.5 MB). Peak memory consumption was 349.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: 192]: Loop Invariant Derived loop invariant: (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && c_dr_pc == 1) && 2 <= q_read_ev) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((0 == q_free && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && 2 <= q_read_ev) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((((((0 == p_dw_st && 0 == p_dw_pc) && 0 == p_last_write) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == q_read_ev) && q_write_ev == 2) && c_last_read == p_last_write) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && 0 == kernel_st) && p_dw_i == 1) && 0 == p_num_write)) || ((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && c_dr_pc == 1) && !(c_dr_st == 0)) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((((((((((0 == p_dw_st && 0 == p_dw_pc) && 0 == p_last_write) && p_last_write == q_buf_0) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == q_read_ev) && q_write_ev == 2) && c_last_read == p_last_write) && 1 == kernel_st) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && p_dw_i == 1) && 0 == p_num_write)) || (((((((0 == q_free && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && !(c_dr_st == 0)) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((((((((((((((((((tmp___0 <= 2147483647 && c_dr_pc == 1) && c_last_read == 0) && 0 == p_last_write) && c_num_read <= 0) && 1 <= c_dr_i) && a == a_t) && tmp == 0) && !(0 == tmp___0)) && 1 == q_free) && q_read_ev <= 2) && __retres1 == 1) && kernel_st <= 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && 2 <= q_write_ev) && __retres1 == \result) && 0 <= c_num_read) && 0 == q_buf_0) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && c_dr_i <= 1) && q_write_ev <= 2) && c_dr_st == 2) && 1 <= kernel_st) && p_dw_i == 1) && 0 == p_num_write)) || (((((((((((((((((((((((((((((((((((((tmp___0 <= 2147483647 && \result == tmp___0) && c_last_read == 0) && c_dr_st == 0) && c_num_read <= 0) && __retres1 <= 1) && 1 <= c_dr_i) && tmp <= 2147483647) && __retres1 == \result) && 0 <= q_buf_0 + 2147483648) && q_read_ev <= 2) && kernel_st <= 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && 0 == __retres1) && q_buf_0 <= 2147483647) && !(tmp == 0)) && 2 <= q_write_ev) && __retres1 == \result) && 0 <= c_num_read) && __retres1 == \result) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_pc <= 0) && 1 == p_dw_pc) && 0 <= c_dr_pc) && c_dr_i <= 1) && 0 == q_free) && 0 <= tmp + 2147483648) && 2 == p_dw_st) && 0 == tmp) && q_write_ev <= 2) && 1 == p_num_write) && a_t == 0) && 1 <= kernel_st) && 1 <= __retres1) && p_dw_i == 1)) || ((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((p_dw_i <= 1 && 1 <= p_dw_i) && tmp___0 <= 2147483647) && c_dr_st == 1) && c_num_read == 1) && __retres1 <= 1) && 1 <= c_dr_i) && tmp == \result) && tmp <= 2147483647) && !(0 == tmp___0)) && 0 <= q_buf_0 + 2147483648) && 1 == q_free) && kernel_st <= 1) && q_read_ev == 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && q_buf_0 <= 2147483647) && !(tmp == 0)) && 2 <= q_write_ev) && __retres1 == \result) && __retres1 == \result) && 0 == p_dw_st) && __retres1 == 0) && c_dr_pc <= 0) && 1 == p_dw_pc) && 0 <= c_dr_pc) && a == c_last_read) && c_dr_i <= 1) && a == q_buf_0) && 0 <= tmp + 2147483648) && q_write_ev <= 2) && 1 == p_num_write) && c_last_read == p_last_write) && a_t == 0) && 1 <= kernel_st) && 1 <= __retres1) && 1 == __retres1) || ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && c_last_read == p_last_write) && c_dr_pc == 1) && 1 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((0 <= c_last_read && p_dw_i <= 1) && 1 <= p_dw_i) && 1 == p_dw_st) && c_dr_st == 0) && __retres1 <= 1) && 1 <= c_dr_i) && tmp == \result) && tmp <= 2147483647) && 0 <= q_buf_0 + 2147483648) && kernel_st <= 1) && tmp___1 == \result) && 0 == __retres1) && q_read_ev == 2) && q_buf_0 <= 2147483647) && !(tmp == 0)) && q_write_ev == 1) && __retres1 == \result) && __retres1 == \result) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && c_num_read == 0) && c_dr_i <= 1) && 0 == q_free) && 0 <= tmp + 2147483648) && 1 == p_num_write) && a_t == 0) && 1 <= kernel_st) && 1 <= __retres1) && c_last_read <= 0) || ((((((c_num_read + 1 <= p_num_write && 0 == q_free) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((((((((((((((((((((((((((((0 <= c_last_read && p_dw_i <= 1) && 1 <= p_dw_i) && tmp___0 <= 2147483647) && c_dr_pc == 1) && 1 == p_dw_st) && __retres1 <= 1) && 1 <= c_dr_i) && a == a_t) && tmp == \result) && tmp <= 2147483647) && !(0 == tmp___0)) && 0 <= q_buf_0 + 2147483648) && kernel_st <= 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && 0 == __retres1) && q_read_ev == 2) && q_buf_0 <= 2147483647) && __retres1 == 1) && !(tmp == 0)) && q_write_ev == 1) && __retres1 == \result) && __retres1 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_dr_i <= 1) && 0 == q_free) && 0 <= tmp + 2147483648) && 1 == p_num_write) && c_dr_st == 2) && 1 <= kernel_st) && 1 <= __retres1) && c_last_read <= 0) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((tmp___0 <= 2147483647 && c_dr_st == 1) && 1 <= c_dr_i) && tmp == 0) && !(0 == tmp___0)) && 1 == q_free) && q_read_ev <= 2) && c_dr_pc == 0) && __retres1 == 1) && kernel_st <= 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && 2 <= q_write_ev) && __retres1 == \result) && 0 == q_buf_0) && 2 <= q_read_ev) && 0 == p_dw_st) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_dr_i <= 1) && q_write_ev <= 2) && c_last_read == p_last_write) && a_t == 0) && 1 <= kernel_st) && p_dw_i == 1) && 0 == p_num_write) || ((((((((((((((((((((((((((((((((((((((tmp___0 <= 2147483647 && \result == tmp___0) && c_last_read == 0) && c_dr_st == 1) && c_num_read <= 0) && __retres1 <= 1) && 1 <= c_dr_i) && tmp <= 2147483647) && __retres1 == \result) && !(0 == tmp___0)) && 0 <= q_buf_0 + 2147483648) && q_read_ev <= 2) && kernel_st <= 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && 0 == __retres1) && q_buf_0 <= 2147483647) && !(tmp == 0)) && 2 <= q_write_ev) && __retres1 == \result) && 0 <= c_num_read) && __retres1 == \result) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_pc <= 0) && 1 == p_dw_pc) && 0 <= c_dr_pc) && c_dr_i <= 1) && 0 == q_free) && 0 <= tmp + 2147483648) && 2 == p_dw_st) && 0 == tmp) && q_write_ev <= 2) && 1 == p_num_write) && a_t == 0) && 1 <= kernel_st) && 1 <= __retres1) && p_dw_i == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && c_last_read == p_last_write) && 1 == q_free) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((tmp <= 2147483647 && 0 <= tmp + 2147483648) && !(tmp == 0)) && ((((((((((((((((((((((((2 <= q_write_ev && __retres1 == \result) && tmp___0 <= 2147483647) && c_dr_pc == 1) && 0 == q_buf_0) && 2 <= q_read_ev) && c_last_read == 0) && 0 == p_dw_pc) && c_num_read == 0) && 1 <= c_dr_i) && a == a_t) && c_dr_i <= 1) && q_write_ev <= 2) && !(0 == tmp___0)) && 1 == q_free) && q_read_ev <= 2) && c_dr_st == 2) && 1 <= kernel_st) && __retres1 == 1) && kernel_st <= 1) && p_dw_i == 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && 0 == p_num_write) || ((((((((((((((((__retres1 == \result && c_last_read == 0) && 0 == p_dw_pc) && 0 == p_last_write) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == q_read_ev) && q_write_ev == 2) && 1 == kernel_st) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && __retres1 == 1) && p_dw_i == 1) && tmp___1 == \result) && 0 == p_num_write))) && 1 == p_dw_st) && p_last_write == q_buf_0) || ((((((((((((((((((((((((((((((((((0 <= c_last_read && p_dw_i <= 1) && 1 <= p_dw_i) && \result == tmp___0) && 1 == p_dw_st) && c_dr_st == 0) && __retres1 <= 1) && 1 <= c_dr_i) && q_write_ev == 2) && tmp == \result) && tmp <= 2147483647) && __retres1 == \result) && 0 <= q_buf_0 + 2147483648) && kernel_st <= 1) && tmp___1 == \result) && 0 == __retres1) && q_read_ev == 2) && q_buf_0 <= 2147483647) && !(tmp == 0)) && __retres1 == \result) && __retres1 == \result) && __retres1 == 0) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && c_num_read == 0) && c_dr_i <= 1) && 0 == q_free) && 0 <= tmp + 2147483648) && 1 == p_num_write) && a_t == 0) && 1 <= kernel_st) && 1 <= __retres1) && c_last_read <= 0)) || (((((((((((((((((((((((((((((((((tmp___0 <= 2147483647 && c_dr_pc == 1) && \result == tmp___0) && c_last_read == 0) && 1 == p_dw_st) && c_dr_st == 0) && 1 <= c_dr_i) && q_write_ev == 2) && a == a_t) && tmp == \result) && tmp <= 2147483647) && __retres1 == \result) && !(0 == tmp___0)) && 0 <= q_buf_0 + 2147483648) && __retres1 == 1) && kernel_st <= 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && 0 == __retres1) && q_read_ev == 2) && q_buf_0 <= 2147483647) && __retres1 == 1) && !(tmp == 0)) && __retres1 == \result) && __retres1 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && c_dr_i <= 1) && 0 == q_free) && 0 <= tmp + 2147483648) && 1 == p_num_write) && 1 <= kernel_st) && p_dw_i == 1)) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && 2 <= q_write_ev) && c_last_read == p_last_write) && c_dr_pc == 1) && 1 == q_free) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((((((((((((((((((((((((((((((p_dw_i <= 1 && 1 <= p_dw_i) && tmp___0 <= 2147483647) && c_dr_st == 1) && c_num_read == 1) && __retres1 <= 1) && 1 <= c_dr_i) && tmp <= 2147483647) && __retres1 == \result) && !(0 == tmp___0)) && 0 <= q_buf_0 + 2147483648) && 1 == q_free) && kernel_st <= 1) && q_read_ev == 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && q_buf_0 <= 2147483647) && !(tmp == 0)) && 2 <= q_write_ev) && __retres1 == \result) && __retres1 == 0) && c_dr_pc <= 0) && 1 == p_dw_pc) && 0 <= c_dr_pc) && a == c_last_read) && c_dr_i <= 1) && a == q_buf_0) && 0 <= tmp + 2147483648) && 2 == p_dw_st) && q_write_ev <= 2) && 1 == p_num_write) && c_last_read == p_last_write) && a_t == 0) && 1 <= kernel_st) && 1 <= __retres1) && 1 == __retres1) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((0 <= c_last_read && p_dw_i <= 1) && 1 <= p_dw_i) && 1 == p_dw_st) && c_dr_st == 0) && __retres1 <= 1) && 1 <= c_dr_i) && tmp <= 2147483647) && 0 <= q_buf_0 + 2147483648) && kernel_st <= 1) && tmp___1 == \result) && 0 == __retres1) && q_read_ev == 2) && q_buf_0 <= 2147483647) && !(tmp == 0)) && q_write_ev == 1) && __retres1 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_dr_pc <= 0) && 0 <= c_dr_pc) && c_num_read == 0) && c_dr_i <= 1) && 0 == q_free) && 0 <= tmp + 2147483648) && 1 == p_num_write) && a_t == 0) && 1 <= kernel_st) && 1 <= __retres1) && c_last_read <= 0) || (((((((c_num_read + 1 <= p_num_write && 0 == q_free) && !(0 == p_dw_st)) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((((((((((((((((((((((0 <= c_last_read && p_dw_i <= 1) && 1 <= p_dw_i) && tmp___0 <= 2147483647) && c_dr_pc == 1) && 1 == p_dw_st) && __retres1 <= 1) && 1 <= c_dr_i) && a == a_t) && tmp <= 2147483647) && !(0 == tmp___0)) && 0 <= q_buf_0 + 2147483648) && kernel_st <= 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && 0 == __retres1) && q_read_ev == 2) && q_buf_0 <= 2147483647) && q_write_ev == 1) && !(tmp == 0)) && __retres1 == \result) && 0 == p_dw_pc) && p_last_write == q_buf_0) && c_num_read == 0) && 0 == q_free) && c_dr_i <= 1) && 0 <= tmp + 2147483648) && 1 == p_num_write) && c_dr_st == 2) && 1 <= kernel_st) && 1 <= __retres1) && c_last_read <= 0) - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && c_dr_pc == 1) && 2 <= q_read_ev) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((0 == q_free && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && 2 <= q_read_ev) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= q_write_ev) && c_dr_pc == 1) && !(c_dr_st == 0)) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) || (((((((0 == q_free && 2 <= p_dw_st) && 2 <= q_write_ev) && c_dr_pc == 1) && !(c_dr_st == 0)) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((((((((((((((((((((((((((((((\result == tmp___0 && c_last_read == 0) && c_dr_st == 0) && c_num_read <= 0) && __retres1 <= 1) && 1 <= c_dr_i) && tmp <= 2147483647) && __retres1 == \result) && 0 <= q_buf_0 + 2147483648) && q_read_ev <= 2) && kernel_st <= 1) && tmp___1 == \result) && 0 == __retres1) && q_buf_0 <= 2147483647) && !(tmp == 0)) && 2 <= q_write_ev) && __retres1 == \result) && 0 <= c_num_read) && __retres1 == \result) && 2 <= q_read_ev) && __retres1 == 0) && p_last_write == q_buf_0) && c_dr_pc <= 0) && 1 == p_dw_pc) && 0 <= c_dr_pc) && c_dr_i <= 1) && 0 == q_free) && 0 <= tmp + 2147483648) && 2 == p_dw_st) && 0 == tmp) && q_write_ev <= 2) && 1 == p_num_write) && a_t == 0) && 1 <= kernel_st) && 1 <= __retres1) && p_dw_i == 1)) || (((((((tmp == 0 && c_dr_i <= 1) && ((((((((((((((((((((__retres1 == \result && 0 <= c_num_read) && tmp___0 <= 2147483647) && 0 == q_buf_0) && c_dr_pc == 1) && 2 <= q_read_ev) && c_last_read == 0) && 0 == p_dw_pc) && 0 == p_last_write) && c_num_read <= 0) && 1 <= c_dr_i) && a == a_t) && ((__retres1 == 1 && c_dr_st == 0) || (0 == p_dw_st && __retres1 == 1))) && !(0 == tmp___0)) && 1 == q_free) && c_dr_st == 2) && p_dw_i == 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && 0 == p_num_write) || ((((((((((((((((__retres1 == \result && 0 == q_buf_0) && 0 == p_dw_st) && c_last_read == 0) && 0 == p_dw_pc) && 0 == p_last_write) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == q_read_ev) && ((__retres1 == 1 && c_dr_st == 0) || (0 == p_dw_st && __retres1 == 1))) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && p_dw_i == 1) && tmp___1 == \result) && 0 == p_num_write))) && 2 <= q_write_ev) && q_write_ev <= 2) && q_read_ev <= 2) && 1 <= kernel_st) && kernel_st <= 1)) || ((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((0 <= tmp + 2147483648 && tmp <= 2147483647) && !(tmp == 0)) && ((((((((((((((((((((((((2 <= q_write_ev && __retres1 == \result) && tmp___0 <= 2147483647) && c_dr_pc == 1) && 0 == q_buf_0) && 2 <= q_read_ev) && c_last_read == 0) && 0 == p_dw_pc) && c_num_read == 0) && 1 <= c_dr_i) && a == a_t) && c_dr_i <= 1) && q_write_ev <= 2) && !(0 == tmp___0)) && 1 == q_free) && q_read_ev <= 2) && c_dr_st == 2) && 1 <= kernel_st) && __retres1 == 1) && kernel_st <= 1) && p_dw_i == 1) && tmp___1 == \result) && 0 <= tmp___0 + 2147483648) && 0 == p_num_write) || ((((((((((((((((__retres1 == \result && c_last_read == 0) && 0 == p_dw_pc) && 0 == p_last_write) && c_dr_st == 0) && 1 == c_dr_i) && c_num_read == 0) && q_write_ev == q_read_ev) && q_write_ev == 2) && 1 == kernel_st) && a_t == 0) && 1 == q_free) && c_dr_pc == 0) && __retres1 == 1) && p_dw_i == 1) && tmp___1 == \result) && 0 == p_num_write))) && p_last_write == q_buf_0) && 1 == p_dw_st) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && !(0 == p_dw_st)) && 2 <= q_write_ev) && c_dr_pc == 1) && 2 <= q_read_ev) && p_last_write == q_buf_0) && 1 == p_dw_pc) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && 2 <= q_write_ev) && p_num_write <= c_num_read + 1) && c_dr_pc == 1) && 2 <= q_read_ev) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 2 error locations. Result: SAFE, OverallTime: 33.3s, OverallIterations: 15, TraceHistogramMax: 4, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.5s, HoareTripleCheckerStatistics: 945 SDtfs, 628 SDslu, 770 SDs, 0 SdLazy, 1681 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 179 SyntacticMatches, 24 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 198 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 70 NumberOfFragments, 2553 HoareAnnotationTreeSize, 14 FomulaSimplifications, 5018 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 14 FomulaSimplificationsInter, 6012 FormulaSimplificationTreeSizeReductionInter, 7.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 698 NumberOfCodeBlocks, 698 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 754 ConstructedInterpolants, 0 QuantifiedInterpolants, 117056 SizeOfPredicates, 4 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 217/238 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 2403, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 70, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 179, TOOLS_POST_TIME[ms]: 229, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 179, TOOLS_QUANTIFIERELIM_TIME[ms]: 175, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 19, FLUID_QUERY_TIME[ms]: 12, FLUID_QUERIES: 271, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 10, DOMAIN_JOIN_TIME[ms]: 1224, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME[ms]: 598, DOMAIN_ISSUBSETEQ_APPLICATIONS: 11, DOMAIN_ISSUBSETEQ_TIME[ms]: 36, DOMAIN_ISBOTTOM_APPLICATIONS: 70, DOMAIN_ISBOTTOM_TIME[ms]: 168, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 1082, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 1082, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 11, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 3, PATH_EXPR_TIME[ms]: 7, REGEX_TO_DAG_TIME[ms]: 5, DAG_COMPRESSION_TIME[ms]: 57, DAG_COMPRESSION_PROCESSED_NODES: 1575, DAG_COMPRESSION_RETAINED_NODES: 187, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...