./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb52621d262b2a79ebd79f9601fb8103d2f4f11e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 10:23:56,670 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 10:23:56,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 10:23:56,689 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 10:23:56,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 10:23:56,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 10:23:56,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 10:23:56,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 10:23:56,695 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 10:23:56,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 10:23:56,697 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 10:23:56,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 10:23:56,698 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 10:23:56,699 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 10:23:56,700 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 10:23:56,701 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 10:23:56,701 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 10:23:56,703 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 10:23:56,705 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 10:23:56,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 10:23:56,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 10:23:56,709 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 10:23:56,711 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 10:23:56,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 10:23:56,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 10:23:56,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 10:23:56,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 10:23:56,714 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 10:23:56,715 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 10:23:56,716 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 10:23:56,716 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 10:23:56,717 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 10:23:56,717 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 10:23:56,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 10:23:56,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 10:23:56,719 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 10:23:56,720 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 10:23:56,734 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 10:23:56,735 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 10:23:56,736 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 10:23:56,736 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 10:23:56,736 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 10:23:56,737 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 10:23:56,737 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 10:23:56,737 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 10:23:56,737 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 10:23:56,737 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 10:23:56,737 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 10:23:56,738 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 10:23:56,738 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 10:23:56,738 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 10:23:56,738 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 10:23:56,738 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 10:23:56,739 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 10:23:56,739 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 10:23:56,739 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 10:23:56,739 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 10:23:56,739 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 10:23:56,739 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 10:23:56,740 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 10:23:56,740 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 10:23:56,740 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 10:23:56,740 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 10:23:56,740 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 10:23:56,741 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 10:23:56,741 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2018-12-31 10:23:56,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 10:23:56,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 10:23:56,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 10:23:56,793 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 10:23:56,793 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 10:23:56,794 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-12-31 10:23:56,859 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5ef0ede/a5932e6e4b1849da86a9d00e720343a7/FLAG916d22c47 [2018-12-31 10:23:57,364 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 10:23:57,365 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-12-31 10:23:57,376 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5ef0ede/a5932e6e4b1849da86a9d00e720343a7/FLAG916d22c47 [2018-12-31 10:23:57,713 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae5ef0ede/a5932e6e4b1849da86a9d00e720343a7 [2018-12-31 10:23:57,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 10:23:57,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 10:23:57,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 10:23:57,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 10:23:57,723 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 10:23:57,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:23:57" (1/1) ... [2018-12-31 10:23:57,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e11ba17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:57, skipping insertion in model container [2018-12-31 10:23:57,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 10:23:57" (1/1) ... [2018-12-31 10:23:57,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 10:23:57,776 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 10:23:58,045 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:23:58,056 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 10:23:58,140 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 10:23:58,170 INFO L195 MainTranslator]: Completed translation [2018-12-31 10:23:58,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58 WrapperNode [2018-12-31 10:23:58,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 10:23:58,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 10:23:58,173 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 10:23:58,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 10:23:58,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (1/1) ... [2018-12-31 10:23:58,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (1/1) ... [2018-12-31 10:23:58,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 10:23:58,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 10:23:58,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 10:23:58,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 10:23:58,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (1/1) ... [2018-12-31 10:23:58,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (1/1) ... [2018-12-31 10:23:58,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (1/1) ... [2018-12-31 10:23:58,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (1/1) ... [2018-12-31 10:23:58,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (1/1) ... [2018-12-31 10:23:58,369 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (1/1) ... [2018-12-31 10:23:58,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (1/1) ... [2018-12-31 10:23:58,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 10:23:58,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 10:23:58,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 10:23:58,376 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 10:23:58,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (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 [2018-12-31 10:23:58,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 10:23:58,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 10:23:59,431 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 10:23:59,431 INFO L280 CfgBuilder]: Removed 64 assue(true) statements. [2018-12-31 10:23:59,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:23:59 BoogieIcfgContainer [2018-12-31 10:23:59,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 10:23:59,433 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 10:23:59,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 10:23:59,436 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 10:23:59,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 10:23:57" (1/3) ... [2018-12-31 10:23:59,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e6999b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:23:59, skipping insertion in model container [2018-12-31 10:23:59,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 10:23:58" (2/3) ... [2018-12-31 10:23:59,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e6999b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 10:23:59, skipping insertion in model container [2018-12-31 10:23:59,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:23:59" (3/3) ... [2018-12-31 10:23:59,440 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell_true-unreach-call_false-termination.cil.c [2018-12-31 10:23:59,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 10:23:59,459 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 10:23:59,477 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 10:23:59,512 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 10:23:59,512 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 10:23:59,513 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 10:23:59,513 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 10:23:59,513 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 10:23:59,513 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 10:23:59,513 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 10:23:59,514 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 10:23:59,514 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 10:23:59,533 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-12-31 10:23:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 10:23:59,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:23:59,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:23:59,545 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:23:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:23:59,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2018-12-31 10:23:59,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:23:59,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:23:59,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:23:59,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:23:59,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:23:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:23:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:23:59,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:23:59,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:23:59,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:23:59,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:23:59,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:23:59,777 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2018-12-31 10:23:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:23:59,856 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2018-12-31 10:23:59,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:23:59,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-31 10:23:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:23:59,872 INFO L225 Difference]: With dead ends: 210 [2018-12-31 10:23:59,872 INFO L226 Difference]: Without dead ends: 104 [2018-12-31 10:23:59,876 INFO L631 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 [2018-12-31 10:23:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-31 10:23:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-31 10:23:59,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-31 10:23:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2018-12-31 10:23:59,925 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2018-12-31 10:23:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:23:59,925 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2018-12-31 10:23:59,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:23:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2018-12-31 10:23:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-31 10:23:59,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:23:59,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:23:59,929 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:23:59,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:23:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2018-12-31 10:23:59,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:23:59,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:23:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:23:59,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:23:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:23:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:00,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:00,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:00,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:00,033 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2018-12-31 10:24:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:00,113 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2018-12-31 10:24:00,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:00,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-12-31 10:24:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:00,116 INFO L225 Difference]: With dead ends: 199 [2018-12-31 10:24:00,116 INFO L226 Difference]: Without dead ends: 104 [2018-12-31 10:24:00,117 INFO L631 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 [2018-12-31 10:24:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-31 10:24:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-31 10:24:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-31 10:24:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-12-31 10:24:00,131 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2018-12-31 10:24:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:00,131 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-12-31 10:24:00,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-12-31 10:24:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-31 10:24:00,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:00,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:00,135 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:00,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:00,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2018-12-31 10:24:00,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:00,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:00,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:00,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:00,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:00,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:00,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:00,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:00,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:00,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:00,211 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-12-31 10:24:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:00,269 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2018-12-31 10:24:00,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:00,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-31 10:24:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:00,272 INFO L225 Difference]: With dead ends: 196 [2018-12-31 10:24:00,272 INFO L226 Difference]: Without dead ends: 104 [2018-12-31 10:24:00,274 INFO L631 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 [2018-12-31 10:24:00,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-31 10:24:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-31 10:24:00,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-31 10:24:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2018-12-31 10:24:00,287 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2018-12-31 10:24:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:00,288 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2018-12-31 10:24:00,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2018-12-31 10:24:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-31 10:24:00,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:00,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:00,292 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:00,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2018-12-31 10:24:00,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:00,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:00,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:00,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:00,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:00,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:00,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:00,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:00,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:00,368 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2018-12-31 10:24:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:00,434 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2018-12-31 10:24:00,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:00,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-31 10:24:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:00,438 INFO L225 Difference]: With dead ends: 193 [2018-12-31 10:24:00,439 INFO L226 Difference]: Without dead ends: 104 [2018-12-31 10:24:00,441 INFO L631 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 [2018-12-31 10:24:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-31 10:24:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-31 10:24:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-31 10:24:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2018-12-31 10:24:00,467 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2018-12-31 10:24:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:00,467 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2018-12-31 10:24:00,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2018-12-31 10:24:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:24:00,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:00,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:00,474 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:00,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:00,474 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2018-12-31 10:24:00,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:00,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:00,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:00,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:00,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:00,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:00,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:00,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:00,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:00,589 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2018-12-31 10:24:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:00,781 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2018-12-31 10:24:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:00,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:24:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:00,787 INFO L225 Difference]: With dead ends: 271 [2018-12-31 10:24:00,787 INFO L226 Difference]: Without dead ends: 191 [2018-12-31 10:24:00,789 INFO L631 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 [2018-12-31 10:24:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-31 10:24:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-12-31 10:24:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-31 10:24:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2018-12-31 10:24:00,807 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2018-12-31 10:24:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:00,808 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2018-12-31 10:24:00,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2018-12-31 10:24:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:24:00,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:00,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:00,813 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2018-12-31 10:24:00,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:00,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:00,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:00,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:00,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:00,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:00,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:00,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:00,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:00,932 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 3 states. [2018-12-31 10:24:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:01,108 INFO L93 Difference]: Finished difference Result 536 states and 876 transitions. [2018-12-31 10:24:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:01,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:24:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:01,112 INFO L225 Difference]: With dead ends: 536 [2018-12-31 10:24:01,113 INFO L226 Difference]: Without dead ends: 371 [2018-12-31 10:24:01,114 INFO L631 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 [2018-12-31 10:24:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-12-31 10:24:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2018-12-31 10:24:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-12-31 10:24:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 590 transitions. [2018-12-31 10:24:01,139 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 590 transitions. Word has length 72 [2018-12-31 10:24:01,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:01,140 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 590 transitions. [2018-12-31 10:24:01,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 590 transitions. [2018-12-31 10:24:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-31 10:24:01,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:01,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:01,144 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:01,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:01,145 INFO L82 PathProgramCache]: Analyzing trace with hash 954019814, now seen corresponding path program 1 times [2018-12-31 10:24:01,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:01,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:01,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:01,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:01,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:01,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:01,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:01,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:01,233 INFO L87 Difference]: Start difference. First operand 368 states and 590 transitions. Second operand 3 states. [2018-12-31 10:24:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:01,338 INFO L93 Difference]: Finished difference Result 697 states and 1126 transitions. [2018-12-31 10:24:01,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:01,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2018-12-31 10:24:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:01,341 INFO L225 Difference]: With dead ends: 697 [2018-12-31 10:24:01,341 INFO L226 Difference]: Without dead ends: 408 [2018-12-31 10:24:01,343 INFO L631 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 [2018-12-31 10:24:01,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-12-31 10:24:01,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-12-31 10:24:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-12-31 10:24:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 648 transitions. [2018-12-31 10:24:01,371 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 648 transitions. Word has length 72 [2018-12-31 10:24:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:01,372 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 648 transitions. [2018-12-31 10:24:01,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:01,372 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 648 transitions. [2018-12-31 10:24:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 10:24:01,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:01,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:01,376 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:01,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1501854766, now seen corresponding path program 1 times [2018-12-31 10:24:01,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:01,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:01,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:01,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:01,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:01,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:01,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:01,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:01,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:01,493 INFO L87 Difference]: Start difference. First operand 408 states and 648 transitions. Second operand 3 states. [2018-12-31 10:24:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:01,836 INFO L93 Difference]: Finished difference Result 1166 states and 1860 transitions. [2018-12-31 10:24:01,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:01,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-31 10:24:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:01,843 INFO L225 Difference]: With dead ends: 1166 [2018-12-31 10:24:01,843 INFO L226 Difference]: Without dead ends: 805 [2018-12-31 10:24:01,844 INFO L631 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 [2018-12-31 10:24:01,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-12-31 10:24:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 802. [2018-12-31 10:24:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2018-12-31 10:24:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1252 transitions. [2018-12-31 10:24:01,879 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1252 transitions. Word has length 73 [2018-12-31 10:24:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:01,879 INFO L480 AbstractCegarLoop]: Abstraction has 802 states and 1252 transitions. [2018-12-31 10:24:01,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1252 transitions. [2018-12-31 10:24:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 10:24:01,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:01,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:01,884 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash -608368428, now seen corresponding path program 1 times [2018-12-31 10:24:01,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:01,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:01,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:01,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:01,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:01,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:01,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:01,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:01,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:01,971 INFO L87 Difference]: Start difference. First operand 802 states and 1252 transitions. Second operand 3 states. [2018-12-31 10:24:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:02,296 INFO L93 Difference]: Finished difference Result 1533 states and 2406 transitions. [2018-12-31 10:24:02,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:02,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-31 10:24:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:02,303 INFO L225 Difference]: With dead ends: 1533 [2018-12-31 10:24:02,303 INFO L226 Difference]: Without dead ends: 926 [2018-12-31 10:24:02,304 INFO L631 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 [2018-12-31 10:24:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2018-12-31 10:24:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2018-12-31 10:24:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-12-31 10:24:02,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1426 transitions. [2018-12-31 10:24:02,349 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1426 transitions. Word has length 73 [2018-12-31 10:24:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:02,349 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 1426 transitions. [2018-12-31 10:24:02,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1426 transitions. [2018-12-31 10:24:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 10:24:02,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:02,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:02,354 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash 778416982, now seen corresponding path program 1 times [2018-12-31 10:24:02,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:02,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:02,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:02,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:02,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:02,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:02,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:02,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:02,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:02,439 INFO L87 Difference]: Start difference. First operand 926 states and 1426 transitions. Second operand 3 states. [2018-12-31 10:24:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:02,704 INFO L93 Difference]: Finished difference Result 1353 states and 2078 transitions. [2018-12-31 10:24:02,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:02,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-31 10:24:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:02,710 INFO L225 Difference]: With dead ends: 1353 [2018-12-31 10:24:02,710 INFO L226 Difference]: Without dead ends: 622 [2018-12-31 10:24:02,711 INFO L631 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 [2018-12-31 10:24:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-12-31 10:24:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2018-12-31 10:24:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-12-31 10:24:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 924 transitions. [2018-12-31 10:24:02,741 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 924 transitions. Word has length 73 [2018-12-31 10:24:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:02,741 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 924 transitions. [2018-12-31 10:24:02,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 924 transitions. [2018-12-31 10:24:02,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-31 10:24:02,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:02,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:02,745 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:02,745 INFO L82 PathProgramCache]: Analyzing trace with hash -936880108, now seen corresponding path program 1 times [2018-12-31 10:24:02,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:02,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:02,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:02,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:02,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:02,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:02,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:02,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:02,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:02,828 INFO L87 Difference]: Start difference. First operand 622 states and 924 transitions. Second operand 3 states. [2018-12-31 10:24:03,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:03,082 INFO L93 Difference]: Finished difference Result 921 states and 1366 transitions. [2018-12-31 10:24:03,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:03,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-12-31 10:24:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:03,087 INFO L225 Difference]: With dead ends: 921 [2018-12-31 10:24:03,087 INFO L226 Difference]: Without dead ends: 442 [2018-12-31 10:24:03,088 INFO L631 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 [2018-12-31 10:24:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-12-31 10:24:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2018-12-31 10:24:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-12-31 10:24:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2018-12-31 10:24:03,112 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 73 [2018-12-31 10:24:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:03,113 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2018-12-31 10:24:03,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2018-12-31 10:24:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-31 10:24:03,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:03,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:03,117 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1482058010, now seen corresponding path program 1 times [2018-12-31 10:24:03,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:03,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:03,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:03,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:03,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:03,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:03,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:03,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:03,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:03,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:03,212 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand 3 states. [2018-12-31 10:24:03,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:03,281 INFO L93 Difference]: Finished difference Result 617 states and 897 transitions. [2018-12-31 10:24:03,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:03,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-31 10:24:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:03,285 INFO L225 Difference]: With dead ends: 617 [2018-12-31 10:24:03,285 INFO L226 Difference]: Without dead ends: 344 [2018-12-31 10:24:03,286 INFO L631 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 [2018-12-31 10:24:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-31 10:24:03,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2018-12-31 10:24:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-12-31 10:24:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2018-12-31 10:24:03,305 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 74 [2018-12-31 10:24:03,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:03,305 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2018-12-31 10:24:03,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2018-12-31 10:24:03,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-31 10:24:03,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:03,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:03,309 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1686276329, now seen corresponding path program 1 times [2018-12-31 10:24:03,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:03,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:03,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:03,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:03,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:03,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:03,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:03,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:03,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:03,429 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand 3 states. [2018-12-31 10:24:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:03,816 INFO L93 Difference]: Finished difference Result 922 states and 1324 transitions. [2018-12-31 10:24:03,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:03,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-31 10:24:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:03,822 INFO L225 Difference]: With dead ends: 922 [2018-12-31 10:24:03,822 INFO L226 Difference]: Without dead ends: 665 [2018-12-31 10:24:03,823 INFO L631 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 [2018-12-31 10:24:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-12-31 10:24:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2018-12-31 10:24:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-12-31 10:24:03,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 932 transitions. [2018-12-31 10:24:03,855 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 932 transitions. Word has length 74 [2018-12-31 10:24:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:03,855 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 932 transitions. [2018-12-31 10:24:03,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:03,856 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 932 transitions. [2018-12-31 10:24:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-31 10:24:03,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:03,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:03,860 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:03,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:03,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1715204629, now seen corresponding path program 1 times [2018-12-31 10:24:03,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:03,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:03,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:03,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:03,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:03,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:03,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:03,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:03,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:03,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:03,944 INFO L87 Difference]: Start difference. First operand 662 states and 932 transitions. Second operand 3 states. [2018-12-31 10:24:04,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:04,266 INFO L93 Difference]: Finished difference Result 1151 states and 1632 transitions. [2018-12-31 10:24:04,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:04,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-31 10:24:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:04,271 INFO L225 Difference]: With dead ends: 1151 [2018-12-31 10:24:04,272 INFO L226 Difference]: Without dead ends: 782 [2018-12-31 10:24:04,273 INFO L631 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 [2018-12-31 10:24:04,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-12-31 10:24:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2018-12-31 10:24:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-12-31 10:24:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1082 transitions. [2018-12-31 10:24:04,313 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1082 transitions. Word has length 74 [2018-12-31 10:24:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:04,313 INFO L480 AbstractCegarLoop]: Abstraction has 782 states and 1082 transitions. [2018-12-31 10:24:04,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1082 transitions. [2018-12-31 10:24:04,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-31 10:24:04,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:04,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:04,319 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:04,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:04,319 INFO L82 PathProgramCache]: Analyzing trace with hash -328419219, now seen corresponding path program 1 times [2018-12-31 10:24:04,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:04,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:04,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:04,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:04,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:04,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:04,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:04,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:04,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:04,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:04,407 INFO L87 Difference]: Start difference. First operand 782 states and 1082 transitions. Second operand 3 states. [2018-12-31 10:24:04,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:04,668 INFO L93 Difference]: Finished difference Result 1061 states and 1472 transitions. [2018-12-31 10:24:04,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:04,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-31 10:24:04,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:04,674 INFO L225 Difference]: With dead ends: 1061 [2018-12-31 10:24:04,674 INFO L226 Difference]: Without dead ends: 572 [2018-12-31 10:24:04,676 INFO L631 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 [2018-12-31 10:24:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-12-31 10:24:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2018-12-31 10:24:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-12-31 10:24:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 766 transitions. [2018-12-31 10:24:04,709 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 766 transitions. Word has length 74 [2018-12-31 10:24:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:04,710 INFO L480 AbstractCegarLoop]: Abstraction has 572 states and 766 transitions. [2018-12-31 10:24:04,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 766 transitions. [2018-12-31 10:24:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 10:24:04,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:04,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:04,714 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:04,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:04,715 INFO L82 PathProgramCache]: Analyzing trace with hash -524997684, now seen corresponding path program 1 times [2018-12-31 10:24:04,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:04,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:04,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:04,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:04,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:04,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:04,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:04,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:04,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:04,808 INFO L87 Difference]: Start difference. First operand 572 states and 766 transitions. Second operand 3 states. [2018-12-31 10:24:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:04,890 INFO L93 Difference]: Finished difference Result 741 states and 1005 transitions. [2018-12-31 10:24:04,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:04,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-31 10:24:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:04,894 INFO L225 Difference]: With dead ends: 741 [2018-12-31 10:24:04,895 INFO L226 Difference]: Without dead ends: 478 [2018-12-31 10:24:04,896 INFO L631 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 [2018-12-31 10:24:04,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-12-31 10:24:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2018-12-31 10:24:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-12-31 10:24:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 638 transitions. [2018-12-31 10:24:04,922 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 638 transitions. Word has length 75 [2018-12-31 10:24:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:04,922 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 638 transitions. [2018-12-31 10:24:04,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 638 transitions. [2018-12-31 10:24:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 10:24:04,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:04,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:04,926 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:04,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1795209225, now seen corresponding path program 1 times [2018-12-31 10:24:04,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:04,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:04,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:04,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:04,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:05,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:05,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:05,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:05,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:05,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:05,011 INFO L87 Difference]: Start difference. First operand 478 states and 638 transitions. Second operand 3 states. [2018-12-31 10:24:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:05,376 INFO L93 Difference]: Finished difference Result 1220 states and 1622 transitions. [2018-12-31 10:24:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:05,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-31 10:24:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:05,382 INFO L225 Difference]: With dead ends: 1220 [2018-12-31 10:24:05,383 INFO L226 Difference]: Without dead ends: 909 [2018-12-31 10:24:05,384 INFO L631 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 [2018-12-31 10:24:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-12-31 10:24:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 906. [2018-12-31 10:24:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2018-12-31 10:24:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1184 transitions. [2018-12-31 10:24:05,428 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1184 transitions. Word has length 75 [2018-12-31 10:24:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:05,428 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1184 transitions. [2018-12-31 10:24:05,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:05,428 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1184 transitions. [2018-12-31 10:24:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-31 10:24:05,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:05,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:05,433 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:05,433 INFO L82 PathProgramCache]: Analyzing trace with hash 810814329, now seen corresponding path program 1 times [2018-12-31 10:24:05,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:05,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:05,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:05,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:05,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:05,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:05,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:05,508 INFO L87 Difference]: Start difference. First operand 906 states and 1184 transitions. Second operand 3 states. [2018-12-31 10:24:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:05,648 INFO L93 Difference]: Finished difference Result 1075 states and 1414 transitions. [2018-12-31 10:24:05,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:05,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-31 10:24:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:05,655 INFO L225 Difference]: With dead ends: 1075 [2018-12-31 10:24:05,656 INFO L226 Difference]: Without dead ends: 1072 [2018-12-31 10:24:05,656 INFO L631 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 [2018-12-31 10:24:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2018-12-31 10:24:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2018-12-31 10:24:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-12-31 10:24:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1410 transitions. [2018-12-31 10:24:05,707 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1410 transitions. Word has length 75 [2018-12-31 10:24:05,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:05,708 INFO L480 AbstractCegarLoop]: Abstraction has 1072 states and 1410 transitions. [2018-12-31 10:24:05,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1410 transitions. [2018-12-31 10:24:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-31 10:24:05,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:05,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:05,713 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:05,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1383852991, now seen corresponding path program 1 times [2018-12-31 10:24:05,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:05,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:05,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:05,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:05,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:05,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:05,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:05,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:05,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:05,795 INFO L87 Difference]: Start difference. First operand 1072 states and 1410 transitions. Second operand 3 states. [2018-12-31 10:24:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:05,962 INFO L93 Difference]: Finished difference Result 1999 states and 2700 transitions. [2018-12-31 10:24:05,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:05,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2018-12-31 10:24:05,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:05,969 INFO L225 Difference]: With dead ends: 1999 [2018-12-31 10:24:05,970 INFO L226 Difference]: Without dead ends: 1006 [2018-12-31 10:24:05,971 INFO L631 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 [2018-12-31 10:24:05,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-12-31 10:24:06,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 940. [2018-12-31 10:24:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-12-31 10:24:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1246 transitions. [2018-12-31 10:24:06,021 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1246 transitions. Word has length 77 [2018-12-31 10:24:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:06,021 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1246 transitions. [2018-12-31 10:24:06,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1246 transitions. [2018-12-31 10:24:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-31 10:24:06,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:06,023 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:06,026 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1984147797, now seen corresponding path program 1 times [2018-12-31 10:24:06,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:06,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:06,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:06,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:06,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:06,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 10:24:06,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 10:24:06,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 10:24:06,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 10:24:06,133 INFO L87 Difference]: Start difference. First operand 940 states and 1246 transitions. Second operand 4 states. [2018-12-31 10:24:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:06,351 INFO L93 Difference]: Finished difference Result 1579 states and 2134 transitions. [2018-12-31 10:24:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 10:24:06,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-31 10:24:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:06,357 INFO L225 Difference]: With dead ends: 1579 [2018-12-31 10:24:06,358 INFO L226 Difference]: Without dead ends: 940 [2018-12-31 10:24:06,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:24:06,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-12-31 10:24:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2018-12-31 10:24:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-12-31 10:24:06,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1240 transitions. [2018-12-31 10:24:06,419 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1240 transitions. Word has length 91 [2018-12-31 10:24:06,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:06,419 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1240 transitions. [2018-12-31 10:24:06,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 10:24:06,419 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1240 transitions. [2018-12-31 10:24:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-31 10:24:06,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:06,424 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:06,424 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:06,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:06,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1157899978, now seen corresponding path program 1 times [2018-12-31 10:24:06,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:06,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:06,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:06,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:06,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:06,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 10:24:06,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 10:24:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 10:24:06,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 10:24:06,596 INFO L87 Difference]: Start difference. First operand 940 states and 1240 transitions. Second operand 4 states. [2018-12-31 10:24:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:06,796 INFO L93 Difference]: Finished difference Result 1579 states and 2122 transitions. [2018-12-31 10:24:06,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 10:24:06,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-31 10:24:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:06,802 INFO L225 Difference]: With dead ends: 1579 [2018-12-31 10:24:06,803 INFO L226 Difference]: Without dead ends: 940 [2018-12-31 10:24:06,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:24:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2018-12-31 10:24:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2018-12-31 10:24:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-12-31 10:24:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1234 transitions. [2018-12-31 10:24:06,879 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1234 transitions. Word has length 92 [2018-12-31 10:24:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:06,880 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1234 transitions. [2018-12-31 10:24:06,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 10:24:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1234 transitions. [2018-12-31 10:24:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-31 10:24:06,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:06,884 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:06,884 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash 433852849, now seen corresponding path program 1 times [2018-12-31 10:24:06,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:06,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:06,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:06,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:06,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:06,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:06,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:06,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:06,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:06,960 INFO L87 Difference]: Start difference. First operand 940 states and 1234 transitions. Second operand 3 states. [2018-12-31 10:24:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:07,254 INFO L93 Difference]: Finished difference Result 2176 states and 2914 transitions. [2018-12-31 10:24:07,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:07,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2018-12-31 10:24:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:07,264 INFO L225 Difference]: With dead ends: 2176 [2018-12-31 10:24:07,264 INFO L226 Difference]: Without dead ends: 1537 [2018-12-31 10:24:07,266 INFO L631 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 [2018-12-31 10:24:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-12-31 10:24:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 958. [2018-12-31 10:24:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-12-31 10:24:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1252 transitions. [2018-12-31 10:24:07,333 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1252 transitions. Word has length 93 [2018-12-31 10:24:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:07,333 INFO L480 AbstractCegarLoop]: Abstraction has 958 states and 1252 transitions. [2018-12-31 10:24:07,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1252 transitions. [2018-12-31 10:24:07,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-31 10:24:07,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:07,337 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:07,337 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:07,338 INFO L82 PathProgramCache]: Analyzing trace with hash 124550695, now seen corresponding path program 1 times [2018-12-31 10:24:07,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:07,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:07,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:07,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:07,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:07,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:07,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 10:24:07,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 10:24:07,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 10:24:07,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 10:24:07,490 INFO L87 Difference]: Start difference. First operand 958 states and 1252 transitions. Second operand 4 states. [2018-12-31 10:24:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:07,746 INFO L93 Difference]: Finished difference Result 1591 states and 2098 transitions. [2018-12-31 10:24:07,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 10:24:07,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-31 10:24:07,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:07,753 INFO L225 Difference]: With dead ends: 1591 [2018-12-31 10:24:07,753 INFO L226 Difference]: Without dead ends: 934 [2018-12-31 10:24:07,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:24:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-12-31 10:24:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2018-12-31 10:24:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2018-12-31 10:24:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1198 transitions. [2018-12-31 10:24:07,825 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1198 transitions. Word has length 94 [2018-12-31 10:24:07,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:07,826 INFO L480 AbstractCegarLoop]: Abstraction has 934 states and 1198 transitions. [2018-12-31 10:24:07,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 10:24:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1198 transitions. [2018-12-31 10:24:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 10:24:07,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:07,830 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:07,830 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:07,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2108597088, now seen corresponding path program 1 times [2018-12-31 10:24:07,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:07,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:07,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:07,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:07,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:07,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:07,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:07,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:07,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:07,906 INFO L87 Difference]: Start difference. First operand 934 states and 1198 transitions. Second operand 3 states. [2018-12-31 10:24:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:08,091 INFO L93 Difference]: Finished difference Result 2188 states and 2860 transitions. [2018-12-31 10:24:08,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:08,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-31 10:24:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:08,100 INFO L225 Difference]: With dead ends: 2188 [2018-12-31 10:24:08,100 INFO L226 Difference]: Without dead ends: 1555 [2018-12-31 10:24:08,102 INFO L631 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 [2018-12-31 10:24:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-12-31 10:24:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 958. [2018-12-31 10:24:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-12-31 10:24:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1222 transitions. [2018-12-31 10:24:08,188 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1222 transitions. Word has length 95 [2018-12-31 10:24:08,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:08,189 INFO L480 AbstractCegarLoop]: Abstraction has 958 states and 1222 transitions. [2018-12-31 10:24:08,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1222 transitions. [2018-12-31 10:24:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 10:24:08,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:08,191 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:08,193 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:08,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:08,194 INFO L82 PathProgramCache]: Analyzing trace with hash -169435042, now seen corresponding path program 1 times [2018-12-31 10:24:08,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:08,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:08,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:08,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:08,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:08,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:08,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:08,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:08,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:08,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:08,264 INFO L87 Difference]: Start difference. First operand 958 states and 1222 transitions. Second operand 3 states. [2018-12-31 10:24:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:08,605 INFO L93 Difference]: Finished difference Result 2220 states and 2810 transitions. [2018-12-31 10:24:08,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:08,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-31 10:24:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:08,613 INFO L225 Difference]: With dead ends: 2220 [2018-12-31 10:24:08,613 INFO L226 Difference]: Without dead ends: 1563 [2018-12-31 10:24:08,615 INFO L631 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 [2018-12-31 10:24:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-12-31 10:24:08,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1560. [2018-12-31 10:24:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2018-12-31 10:24:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1914 transitions. [2018-12-31 10:24:08,741 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1914 transitions. Word has length 95 [2018-12-31 10:24:08,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:08,742 INFO L480 AbstractCegarLoop]: Abstraction has 1560 states and 1914 transitions. [2018-12-31 10:24:08,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1914 transitions. [2018-12-31 10:24:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 10:24:08,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:08,746 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:08,747 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:08,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:08,747 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2018-12-31 10:24:08,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:08,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:08,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:08,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:09,201 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-12-31 10:24:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:09,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 10:24:09,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 10:24:09,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:09,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 10:24:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:09,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 10:24:09,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-12-31 10:24:09,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 10:24:09,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 10:24:09,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:24:09,655 INFO L87 Difference]: Start difference. First operand 1560 states and 1914 transitions. Second operand 5 states. [2018-12-31 10:24:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:10,227 INFO L93 Difference]: Finished difference Result 3204 states and 3972 transitions. [2018-12-31 10:24:10,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 10:24:10,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-12-31 10:24:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:10,241 INFO L225 Difference]: With dead ends: 3204 [2018-12-31 10:24:10,242 INFO L226 Difference]: Without dead ends: 2501 [2018-12-31 10:24:10,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:24:10,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2018-12-31 10:24:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 1610. [2018-12-31 10:24:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2018-12-31 10:24:10,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1982 transitions. [2018-12-31 10:24:10,428 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1982 transitions. Word has length 95 [2018-12-31 10:24:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:10,430 INFO L480 AbstractCegarLoop]: Abstraction has 1610 states and 1982 transitions. [2018-12-31 10:24:10,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 10:24:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1982 transitions. [2018-12-31 10:24:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 10:24:10,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:10,434 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:10,434 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:10,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2018-12-31 10:24:10,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:10,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:10,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:10,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:10,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 10:24:10,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 10:24:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 10:24:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 10:24:10,516 INFO L87 Difference]: Start difference. First operand 1610 states and 1982 transitions. Second operand 3 states. [2018-12-31 10:24:10,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:10,877 INFO L93 Difference]: Finished difference Result 3706 states and 4622 transitions. [2018-12-31 10:24:10,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 10:24:10,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2018-12-31 10:24:10,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:10,890 INFO L225 Difference]: With dead ends: 3706 [2018-12-31 10:24:10,890 INFO L226 Difference]: Without dead ends: 2603 [2018-12-31 10:24:10,893 INFO L631 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 [2018-12-31 10:24:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2018-12-31 10:24:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1628. [2018-12-31 10:24:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-12-31 10:24:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2000 transitions. [2018-12-31 10:24:11,094 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2000 transitions. Word has length 95 [2018-12-31 10:24:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:11,094 INFO L480 AbstractCegarLoop]: Abstraction has 1628 states and 2000 transitions. [2018-12-31 10:24:11,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 10:24:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2000 transitions. [2018-12-31 10:24:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-31 10:24:11,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 10:24:11,099 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 10:24:11,099 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 10:24:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 10:24:11,100 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2018-12-31 10:24:11,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 10:24:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 10:24:11,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:11,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 10:24:11,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 10:24:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 10:24:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 10:24:11,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 10:24:11,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 10:24:11,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 10:24:11,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 10:24:11,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 10:24:11,246 INFO L87 Difference]: Start difference. First operand 1628 states and 2000 transitions. Second operand 4 states. [2018-12-31 10:24:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 10:24:11,566 INFO L93 Difference]: Finished difference Result 1970 states and 2418 transitions. [2018-12-31 10:24:11,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 10:24:11,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-12-31 10:24:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 10:24:11,567 INFO L225 Difference]: With dead ends: 1970 [2018-12-31 10:24:11,567 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 10:24:11,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 10:24:11,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 10:24:11,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 10:24:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 10:24:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 10:24:11,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2018-12-31 10:24:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 10:24:11,572 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 10:24:11,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 10:24:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 10:24:11,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 10:24:11,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 10:24:11,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:11,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:11,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:11,743 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2018-12-31 10:24:11,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:11,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:11,906 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2018-12-31 10:24:11,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:11,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:11,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:11,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:11,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,169 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,234 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 118 [2018-12-31 10:24:12,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,684 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2018-12-31 10:24:12,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,787 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2018-12-31 10:24:12,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:12,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,400 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2018-12-31 10:24:13,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 10:24:13,614 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 118 [2018-12-31 10:24:17,162 WARN L181 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2018-12-31 10:24:19,053 WARN L181 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-31 10:24:19,595 WARN L181 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 44 [2018-12-31 10:24:20,005 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-12-31 10:24:20,233 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-12-31 10:24:21,177 WARN L181 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-12-31 10:24:21,395 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-12-31 10:24:21,823 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-12-31 10:24:22,500 WARN L181 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-31 10:24:22,731 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-12-31 10:24:23,093 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-12-31 10:24:23,318 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-12-31 10:24:23,713 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 44 [2018-12-31 10:24:24,292 WARN L181 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 44 [2018-12-31 10:24:24,785 WARN L181 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-12-31 10:24:25,543 WARN L181 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-31 10:24:25,849 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-12-31 10:24:26,741 WARN L181 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-31 10:24:27,072 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-12-31 10:24:27,527 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-12-31 10:24:27,847 WARN L181 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2018-12-31 10:24:28,052 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2018-12-31 10:24:28,724 WARN L181 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-31 10:24:28,951 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-12-31 10:24:29,675 WARN L181 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-31 10:24:30,083 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 44 [2018-12-31 10:24:30,796 WARN L181 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-12-31 10:24:31,527 WARN L181 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-12-31 10:24:32,269 WARN L181 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-12-31 10:24:32,272 INFO L448 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2018-12-31 10:24:32,273 INFO L451 ceAbstractionStarter]: At program point L499(lines 483 501) the Hoare annotation is: true [2018-12-31 10:24:32,273 INFO L444 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~d1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse5 .cse8))) [2018-12-31 10:24:32,273 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 208) no Hoare annotation was computed. [2018-12-31 10:24:32,273 INFO L444 ceAbstractionStarter]: At program point L202-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse5 (= ~b1_req_up~0 1)) (.cse6 (<= 2 ~d1_ev~0)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse9 (<= 2 ~b1_ev~0)) (.cse10 (= ~d1_req_up~0 1)) (.cse11 (= 0 ~z_val_t~0)) (.cse12 (<= ~z_val~0 0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= 2 ~z_ev~0)) (.cse16 (= ~d0_req_up~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~b0_ev~0 0) .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~b0_ev~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2018-12-31 10:24:32,273 INFO L448 ceAbstractionStarter]: For program point L202-2(lines 202 208) no Hoare annotation was computed. [2018-12-31 10:24:32,274 INFO L444 ceAbstractionStarter]: At program point L202-3(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~d1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse5 .cse8))) [2018-12-31 10:24:32,274 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-12-31 10:24:32,274 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2018-12-31 10:24:32,274 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 105 115) no Hoare annotation was computed. [2018-12-31 10:24:32,274 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 177) no Hoare annotation was computed. [2018-12-31 10:24:32,274 INFO L448 ceAbstractionStarter]: For program point L172-2(lines 172 177) no Hoare annotation was computed. [2018-12-31 10:24:32,274 INFO L448 ceAbstractionStarter]: For program point L172-3(lines 172 177) no Hoare annotation was computed. [2018-12-31 10:24:32,274 INFO L448 ceAbstractionStarter]: For program point L172-5(lines 172 177) no Hoare annotation was computed. [2018-12-31 10:24:32,274 INFO L444 ceAbstractionStarter]: At program point L404(lines 393 406) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2018-12-31 10:24:32,275 INFO L444 ceAbstractionStarter]: At program point L405(lines 389 407) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2018-12-31 10:24:32,275 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-12-31 10:24:32,275 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2018-12-31 10:24:32,275 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2018-12-31 10:24:32,275 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2018-12-31 10:24:32,275 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 147) no Hoare annotation was computed. [2018-12-31 10:24:32,275 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2018-12-31 10:24:32,275 INFO L448 ceAbstractionStarter]: For program point L142-2(lines 142 147) no Hoare annotation was computed. [2018-12-31 10:24:32,275 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2018-12-31 10:24:32,275 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-12-31 10:24:32,276 INFO L448 ceAbstractionStarter]: For program point L142-3(lines 142 147) no Hoare annotation was computed. [2018-12-31 10:24:32,282 INFO L448 ceAbstractionStarter]: For program point L142-5(lines 142 147) no Hoare annotation was computed. [2018-12-31 10:24:32,283 INFO L444 ceAbstractionStarter]: At program point L209(lines 201 239) the Hoare annotation is: (let ((.cse8 (<= 2 ~b1_ev~0)) (.cse12 (= ~b0_ev~0 0)) (.cse20 (= ~b1_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse19 (<= 2 ~b0_ev~0)) (.cse5 (<= 2 ~d1_ev~0)) (.cse6 (<= 1 ~d1_val_t~0)) (.cse7 (<= 1 ~b1_val_t~0)) (.cse9 (= ~d1_req_up~0 1)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0)) (.cse18 (= ~d0_req_up~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse20 .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2018-12-31 10:24:32,283 INFO L444 ceAbstractionStarter]: At program point L209-1(lines 201 239) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~d1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse5 .cse8))) [2018-12-31 10:24:32,283 INFO L448 ceAbstractionStarter]: For program point L276(line 276) no Hoare annotation was computed. [2018-12-31 10:24:32,283 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2018-12-31 10:24:32,284 INFO L448 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2018-12-31 10:24:32,284 INFO L448 ceAbstractionStarter]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2018-12-31 10:24:32,284 INFO L448 ceAbstractionStarter]: For program point L344-3(lines 343 371) no Hoare annotation was computed. [2018-12-31 10:24:32,284 INFO L444 ceAbstractionStarter]: At program point L245-1(lines 311 315) the Hoare annotation is: (let ((.cse10 (= ~b0_ev~0 0)) (.cse20 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b1_ev~0)) (.cse0 (= ~b1_ev~0 0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 1 ~d1_val~0)) (.cse8 (= 0 ~z_val_t~0)) (.cse9 (<= ~z_val~0 0)) (.cse11 (<= 1 ~d0_val~0)) (.cse12 (<= 1 ~d0_val_t~0)) (.cse13 (<= ~b0_req_up~0 0)) (.cse14 (= ~d0_ev~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse20 .cse3 .cse4 .cse18 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-12-31 10:24:32,284 INFO L448 ceAbstractionStarter]: For program point L311-4(lines 310 338) no Hoare annotation was computed. [2018-12-31 10:24:32,284 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-12-31 10:24:32,284 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2018-12-31 10:24:32,284 INFO L444 ceAbstractionStarter]: At program point L445(lines 491 497) the Hoare annotation is: (and (= ~z_val~0 0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0)) [2018-12-31 10:24:32,284 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2018-12-31 10:24:32,285 INFO L448 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2018-12-31 10:24:32,285 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2018-12-31 10:24:32,285 INFO L444 ceAbstractionStarter]: At program point L380-2(lines 344 348) the Hoare annotation is: (let ((.cse2 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse3 (= ~b1_ev~0 1)) (.cse4 (not (= ~z_req_up~0 1))) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse19 (= ~d0_ev~0 1)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse4 .cse5 .cse18 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-12-31 10:24:32,285 INFO L448 ceAbstractionStarter]: For program point L380-3(lines 380 384) no Hoare annotation was computed. [2018-12-31 10:24:32,285 INFO L444 ceAbstractionStarter]: At program point L380-5(lines 344 348) the Hoare annotation is: (let ((.cse12 (<= 1 ~d1_val_t~0)) (.cse0 (<= 1 ~b0_val~0)) (.cse1 (not (= ~z_req_up~0 1))) (.cse2 (<= 1 ~b0_val_t~0)) (.cse3 (<= 2 ~b0_ev~0)) (.cse4 (<= 1 ~b1_val_t~0)) (.cse5 (<= 2 ~b1_ev~0)) (.cse6 (<= 1 ~d0_val~0)) (.cse7 (<= 1 ~d0_val_t~0)) (.cse8 (<= ~b0_req_up~0 0)) (.cse9 (<= ~b1_req_up~0 0)) (.cse11 (<= 1 ~b1_val~0)) (.cse10 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~d1_val~0))) (or (and (and (<= 0 ~z_val~0) .cse0 (<= 2 ~d0_ev~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~z_val~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) (and .cse12 (and (= ~z_val~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~d0_ev~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10) .cse13))) [2018-12-31 10:24:32,285 INFO L444 ceAbstractionStarter]: At program point L480(lines 451 482) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (= ~b1_req_up~0 1) (<= 2 ~d1_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (= ~d1_req_up~0 1) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (<= ~z_val~0 0) (<= 1 ~d0_val_t~0) (<= 2 ~z_ev~0) (= ~d0_req_up~0 1)) [2018-12-31 10:24:32,286 INFO L444 ceAbstractionStarter]: At program point L216(lines 201 239) the Hoare annotation is: (let ((.cse0 (= ~b1_ev~0 0)) (.cse6 (<= 2 ~b0_ev~0)) (.cse3 (<= 2 ~d0_ev~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse4 (not (= ~z_req_up~0 1))) (.cse5 (<= 1 ~b0_val_t~0)) (.cse7 (<= 2 ~d1_ev~0)) (.cse8 (<= 1 ~d1_val_t~0)) (.cse9 (<= 1 ~b1_val_t~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse10 (= ~d1_req_up~0 1)) (.cse11 (= 0 ~z_val_t~0)) (.cse12 (<= ~z_val~0 0)) (.cse19 (= ~b0_ev~0 0)) (.cse13 (<= 1 ~d0_val~0)) (.cse14 (<= 1 ~d0_val_t~0)) (.cse15 (<= ~b0_req_up~0 0)) (.cse21 (= ~d0_ev~0 0)) (.cse16 (<= ~b1_req_up~0 0)) (.cse17 (<= 2 ~z_ev~0)) (.cse18 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse12 .cse19 .cse13 .cse14 .cse15 .cse21 .cse16 .cse17 .cse18))) [2018-12-31 10:24:32,286 INFO L444 ceAbstractionStarter]: At program point L216-1(lines 201 239) the Hoare annotation is: (let ((.cse14 (= ~d0_ev~0 0)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse9 (= 0 ~z_val_t~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse18 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse10 (<= ~z_val~0 0)) (.cse11 (<= 1 ~d0_val~0)) (.cse12 (<= 1 ~d0_val_t~0)) (.cse13 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (and .cse1 .cse2 .cse18 .cse3 .cse4 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and (and .cse1 .cse2 .cse19 .cse18 .cse3 .cse4 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) .cse5 .cse8))) [2018-12-31 10:24:32,286 INFO L448 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2018-12-31 10:24:32,286 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2018-12-31 10:24:32,286 INFO L448 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2018-12-31 10:24:32,286 INFO L448 ceAbstractionStarter]: For program point L349-3(lines 343 371) no Hoare annotation was computed. [2018-12-31 10:24:32,286 INFO L448 ceAbstractionStarter]: For program point L316-3(lines 310 338) no Hoare annotation was computed. [2018-12-31 10:24:32,287 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-12-31 10:24:32,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 10:24:32,287 INFO L444 ceAbstractionStarter]: At program point L119(lines 96 121) the Hoare annotation is: (let ((.cse2 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse3 (= ~b1_ev~0 1)) (.cse4 (not (= ~z_req_up~0 1))) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse19 (= ~d0_ev~0 1)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse4 .cse5 .cse18 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-12-31 10:24:32,287 INFO L444 ceAbstractionStarter]: At program point L119-1(lines 96 121) the Hoare annotation is: (let ((.cse12 (<= 1 ~d1_val_t~0)) (.cse0 (<= 1 ~b0_val~0)) (.cse1 (not (= ~z_req_up~0 1))) (.cse2 (<= 1 ~b0_val_t~0)) (.cse3 (<= 2 ~b0_ev~0)) (.cse4 (<= 1 ~b1_val_t~0)) (.cse5 (<= 2 ~b1_ev~0)) (.cse6 (<= 1 ~d0_val~0)) (.cse7 (<= 1 ~d0_val_t~0)) (.cse8 (<= ~b0_req_up~0 0)) (.cse9 (<= ~b1_req_up~0 0)) (.cse11 (<= 1 ~b1_val~0)) (.cse10 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~d1_val~0))) (or (and (and (<= 0 ~z_val~0) .cse0 (<= 2 ~d0_ev~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~z_val~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) (and .cse12 (and (= ~z_val~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~d0_ev~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10) .cse13))) [2018-12-31 10:24:32,287 INFO L444 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~d1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse5 .cse8))) [2018-12-31 10:24:32,288 INFO L444 ceAbstractionStarter]: At program point L120(lines 93 122) the Hoare annotation is: (let ((.cse2 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse3 (= ~b1_ev~0 1)) (.cse4 (not (= ~z_req_up~0 1))) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse19 (= ~d0_ev~0 1)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse4 .cse5 .cse18 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-12-31 10:24:32,288 INFO L444 ceAbstractionStarter]: At program point L120-1(lines 93 122) the Hoare annotation is: (let ((.cse12 (<= 1 ~d1_val_t~0)) (.cse0 (<= 1 ~b0_val~0)) (.cse1 (not (= ~z_req_up~0 1))) (.cse2 (<= 1 ~b0_val_t~0)) (.cse3 (<= 2 ~b0_ev~0)) (.cse4 (<= 1 ~b1_val_t~0)) (.cse5 (<= 2 ~b1_ev~0)) (.cse6 (<= 1 ~d0_val~0)) (.cse7 (<= 1 ~d0_val_t~0)) (.cse8 (<= ~b0_req_up~0 0)) (.cse9 (<= ~b1_req_up~0 0)) (.cse11 (<= 1 ~b1_val~0)) (.cse10 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~d1_val~0))) (or (and (and (<= 0 ~z_val~0) .cse0 (<= 2 ~d0_ev~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~z_val~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) (and .cse12 (and (= ~z_val~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~d0_ev~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10) .cse13))) [2018-12-31 10:24:32,288 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 192) no Hoare annotation was computed. [2018-12-31 10:24:32,288 INFO L448 ceAbstractionStarter]: For program point L187-2(lines 187 192) no Hoare annotation was computed. [2018-12-31 10:24:32,288 INFO L448 ceAbstractionStarter]: For program point L187-3(lines 187 192) no Hoare annotation was computed. [2018-12-31 10:24:32,288 INFO L448 ceAbstractionStarter]: For program point L187-5(lines 187 192) no Hoare annotation was computed. [2018-12-31 10:24:32,288 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2018-12-31 10:24:32,288 INFO L448 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2018-12-31 10:24:32,289 INFO L448 ceAbstractionStarter]: For program point L354-3(lines 343 371) no Hoare annotation was computed. [2018-12-31 10:24:32,289 INFO L448 ceAbstractionStarter]: For program point L321-3(lines 310 338) no Hoare annotation was computed. [2018-12-31 10:24:32,289 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2018-12-31 10:24:32,289 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 10:24:32,289 INFO L444 ceAbstractionStarter]: At program point L223(lines 201 239) the Hoare annotation is: (let ((.cse19 (= ~b0_ev~0 0)) (.cse20 (<= 2 ~d0_ev~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse18 (= ~b1_ev~0 0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse8 (<= 1 ~d1_val~0)) (.cse9 (= 0 ~z_val_t~0)) (.cse10 (<= ~z_val~0 0)) (.cse11 (<= 1 ~d0_val~0)) (.cse12 (<= 1 ~d0_val_t~0)) (.cse13 (<= ~b0_req_up~0 0)) (.cse14 (= ~d0_ev~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse20 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-12-31 10:24:32,289 INFO L444 ceAbstractionStarter]: At program point L223-1(lines 201 239) the Hoare annotation is: (let ((.cse14 (= ~d0_ev~0 0)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse9 (= 0 ~z_val_t~0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse19 (<= 2 ~d0_ev~0)) (.cse18 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse10 (<= ~z_val~0 0)) (.cse11 (<= 1 ~d0_val~0)) (.cse12 (<= 1 ~d0_val_t~0)) (.cse13 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (and .cse1 .cse2 .cse18 .cse3 .cse4 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and (and .cse1 .cse2 .cse19 .cse18 .cse3 .cse4 .cse6 .cse7 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) .cse5 .cse8))) [2018-12-31 10:24:32,290 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2018-12-31 10:24:32,290 INFO L448 ceAbstractionStarter]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2018-12-31 10:24:32,290 INFO L448 ceAbstractionStarter]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2018-12-31 10:24:32,290 INFO L448 ceAbstractionStarter]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2018-12-31 10:24:32,290 INFO L444 ceAbstractionStarter]: At program point L422-1(lines 340 444) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2018-12-31 10:24:32,290 INFO L448 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2018-12-31 10:24:32,290 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2018-12-31 10:24:32,290 INFO L448 ceAbstractionStarter]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2018-12-31 10:24:32,290 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 132) no Hoare annotation was computed. [2018-12-31 10:24:32,291 INFO L448 ceAbstractionStarter]: For program point L127-2(lines 127 132) no Hoare annotation was computed. [2018-12-31 10:24:32,291 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 10:24:32,291 INFO L448 ceAbstractionStarter]: For program point L127-3(lines 127 132) no Hoare annotation was computed. [2018-12-31 10:24:32,291 INFO L448 ceAbstractionStarter]: For program point L127-5(lines 127 132) no Hoare annotation was computed. [2018-12-31 10:24:32,291 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-12-31 10:24:32,291 INFO L451 ceAbstractionStarter]: At program point L491(lines 491 497) the Hoare annotation is: true [2018-12-31 10:24:32,291 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2018-12-31 10:24:32,291 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2018-12-31 10:24:32,291 INFO L448 ceAbstractionStarter]: For program point L359-3(lines 343 371) no Hoare annotation was computed. [2018-12-31 10:24:32,291 INFO L448 ceAbstractionStarter]: For program point L326-3(lines 310 338) no Hoare annotation was computed. [2018-12-31 10:24:32,292 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2018-12-31 10:24:32,292 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2018-12-31 10:24:32,292 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2018-12-31 10:24:32,292 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 97 117) no Hoare annotation was computed. [2018-12-31 10:24:32,292 INFO L444 ceAbstractionStarter]: At program point L230(lines 245 249) the Hoare annotation is: (let ((.cse10 (= ~b0_ev~0 0)) (.cse20 (<= 2 ~d0_ev~0)) (.cse19 (<= 2 ~b1_ev~0)) (.cse0 (= ~b1_ev~0 0)) (.cse1 (<= 0 ~z_val~0)) (.cse2 (<= 1 ~b0_val~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= 1 ~b0_val_t~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 1 ~d1_val~0)) (.cse8 (= 0 ~z_val_t~0)) (.cse9 (<= ~z_val~0 0)) (.cse11 (<= 1 ~d0_val~0)) (.cse12 (<= 1 ~d0_val_t~0)) (.cse13 (<= ~b0_req_up~0 0)) (.cse14 (= ~d0_ev~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse1 .cse2 .cse20 .cse3 .cse4 .cse18 .cse5 .cse6 .cse19 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-12-31 10:24:32,292 INFO L444 ceAbstractionStarter]: At program point L230-1(lines 198 240) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (not (= ~z_req_up~0 1))) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse5 (<= 1 ~b1_val_t~0)) (.cse6 (<= 2 ~b1_ev~0)) (.cse7 (<= ~z_val~0 0)) (.cse8 (<= 1 ~d0_val~0)) (.cse9 (<= 1 ~d0_val_t~0)) (.cse10 (<= ~b0_req_up~0 0)) (.cse11 (<= ~b1_req_up~0 0)) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~b1_val~0)) (.cse14 (<= 1 ~d1_val_t~0)) (.cse15 (<= 1 ~d1_val~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~d0_ev~0 0) .cse11 .cse12 .cse13) .cse14 .cse15) (and (and .cse0 .cse1 (<= 2 ~d0_ev~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15))) [2018-12-31 10:24:32,292 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 10:24:32,293 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2018-12-31 10:24:32,293 INFO L444 ceAbstractionStarter]: At program point L331-1(lines 307 339) the Hoare annotation is: (let ((.cse2 (<= 2 ~d0_ev~0)) (.cse20 (<= 2 ~b1_ev~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse3 (= ~b1_ev~0 1)) (.cse4 (not (= ~z_req_up~0 1))) (.cse5 (<= 1 ~b0_val_t~0)) (.cse6 (= ~b0_ev~0 1)) (.cse7 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~b1_val_t~0)) (.cse19 (= ~d0_ev~0 1)) (.cse9 (<= 1 ~d1_val~0)) (.cse10 (= 0 ~z_val_t~0)) (.cse11 (<= ~z_val~0 0)) (.cse12 (<= 1 ~d0_val~0)) (.cse13 (<= 1 ~d0_val_t~0)) (.cse14 (<= ~b0_req_up~0 0)) (.cse15 (<= ~b1_req_up~0 0)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (<= 1 ~b1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse4 .cse5 .cse18 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse18 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse20 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-12-31 10:24:32,293 INFO L444 ceAbstractionStarter]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~d1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse5 .cse8))) [2018-12-31 10:24:32,293 INFO L444 ceAbstractionStarter]: At program point L364-3(lines 340 372) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2018-12-31 10:24:32,294 INFO L444 ceAbstractionStarter]: At program point L331-3(lines 307 339) the Hoare annotation is: (let ((.cse12 (<= 1 ~d1_val_t~0)) (.cse0 (<= 1 ~b0_val~0)) (.cse1 (not (= ~z_req_up~0 1))) (.cse2 (<= 1 ~b0_val_t~0)) (.cse3 (<= 2 ~b0_ev~0)) (.cse4 (<= 1 ~b1_val_t~0)) (.cse5 (<= 2 ~b1_ev~0)) (.cse6 (<= 1 ~d0_val~0)) (.cse7 (<= 1 ~d0_val_t~0)) (.cse8 (<= ~b0_req_up~0 0)) (.cse9 (<= ~b1_req_up~0 0)) (.cse11 (<= 1 ~b1_val~0)) (.cse10 (<= 2 ~z_ev~0)) (.cse13 (<= 1 ~d1_val~0))) (or (and (and (<= 0 ~z_val~0) .cse0 (<= 2 ~d0_ev~0) .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~z_val~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) (and .cse12 (and (= ~z_val~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~d0_ev~0 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse10) .cse13))) [2018-12-31 10:24:32,294 INFO L444 ceAbstractionStarter]: At program point L265-1(lines 257 267) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2018-12-31 10:24:32,294 INFO L444 ceAbstractionStarter]: At program point L266(lines 254 268) the Hoare annotation is: (let ((.cse0 (<= 0 ~z_val~0)) (.cse1 (<= 1 ~b0_val~0)) (.cse2 (<= 2 ~d0_ev~0)) (.cse3 (<= 1 ~b0_val_t~0)) (.cse4 (<= 2 ~b0_ev~0)) (.cse6 (<= 1 ~b1_val_t~0)) (.cse7 (<= 2 ~b1_ev~0)) (.cse9 (<= ~z_val~0 0)) (.cse10 (<= 1 ~d0_val~0)) (.cse11 (<= 1 ~d0_val_t~0)) (.cse12 (<= ~b0_req_up~0 0)) (.cse13 (<= ~b1_req_up~0 0)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (<= 1 ~b1_val~0)) (.cse5 (<= 1 ~d1_val_t~0)) (.cse8 (<= 1 ~d1_val~0))) (or (and (<= 2 ~comp_m1_st~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= 0 ~z_val_t~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse5 .cse8))) [2018-12-31 10:24:32,294 INFO L444 ceAbstractionStarter]: At program point L266-1(lines 254 268) the Hoare annotation is: (and (<= 0 ~z_val~0) (<= 1 ~b0_val~0) (<= 2 ~d0_ev~0) (not (= ~z_req_up~0 1)) (<= 1 ~b0_val_t~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (<= 2 ~b1_ev~0) (<= 1 ~d1_val~0) (<= ~z_val~0 0) (<= 1 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= ~b0_req_up~0 0) (<= ~b1_req_up~0 0) (<= 2 ~z_ev~0) (<= 1 ~b1_val~0)) [2018-12-31 10:24:32,294 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2018-12-31 10:24:32,294 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 101 116) no Hoare annotation was computed. [2018-12-31 10:24:32,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 10:24:32 BoogieIcfgContainer [2018-12-31 10:24:32,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 10:24:32,411 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 10:24:32,411 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 10:24:32,411 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 10:24:32,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 10:23:59" (3/4) ... [2018-12-31 10:24:32,418 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 10:24:32,437 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 10:24:32,438 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 10:24:32,593 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 10:24:32,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 10:24:32,601 INFO L168 Benchmark]: Toolchain (without parser) took 34883.79 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 516.4 MB). Free memory was 946.0 MB in the beginning and 1.3 GB in the end (delta: -349.8 MB). Peak memory consumption was 166.6 MB. Max. memory is 11.5 GB. [2018-12-31 10:24:32,602 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:24:32,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.58 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 10:24:32,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.31 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 10:24:32,603 INFO L168 Benchmark]: Boogie Preprocessor took 124.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-31 10:24:32,603 INFO L168 Benchmark]: RCFGBuilder took 1056.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-31 10:24:32,603 INFO L168 Benchmark]: TraceAbstraction took 32977.29 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 403.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -242.2 MB). Peak memory consumption was 637.2 MB. Max. memory is 11.5 GB. [2018-12-31 10:24:32,604 INFO L168 Benchmark]: Witness Printer took 187.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-12-31 10:24:32,612 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 451.58 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.31 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 124.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -169.8 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1056.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32977.29 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 403.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -242.2 MB). Peak memory consumption was 637.2 MB. Max. memory is 11.5 GB. * Witness Printer took 187.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((1 <= d1_val_t && ((((((((((((z_val == 0 && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 1 <= b1_val) && 2 <= z_ev) && 1 <= d1_val) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && b1_req_up == 1) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && b0_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && 2 <= z_ev) && d0_req_up == 1 - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 389]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 311]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 483]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((1 <= d1_val_t && ((((((((((((z_val == 0 && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 1 <= b1_val) && 2 <= z_ev) && 1 <= d1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((1 <= d1_val_t && ((((((((((((z_val == 0 && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 1 <= b1_val) && 2 <= z_ev) && 1 <= d1_val) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 344]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && d0_req_up == 1) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b1_req_up == 1) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 2 <= z_ev) && d0_req_up == 1) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && b1_req_up == 1) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val_t) && b0_req_up <= 0) && 2 <= z_ev) && d0_req_up == 1) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 254]: Loop Invariant Derived loop invariant: (((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 491]: Loop Invariant Derived loop invariant: (z_val == 0 && b0_req_up <= 0) && b1_req_up <= 0 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) || ((1 <= d1_val_t && ((((((((((((z_val == 0 && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 1 <= b1_val) && 2 <= z_ev) && 1 <= d1_val) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || (((((((((((((((((0 <= z_val && 1 <= b0_val) && b1_ev == 1) && !(z_req_up == 1)) && 1 <= b0_val_t) && b0_ev == 1) && 1 <= d1_val_t) && 1 <= b1_val_t) && d0_ev == 1) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: (((((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val)) || (((((((((((((((((2 <= comp_m1_st && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && 1 <= d1_val) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 1 <= b1_val_t) && 2 <= b1_ev) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) && 1 <= d1_val_t) && 1 <= d1_val) - InvariantResult [Line: 201]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((b1_ev == 0 && 0 <= z_val) && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= b0_ev) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && 2 <= d0_ev) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val)) || ((((((((((((((((((0 <= z_val && 1 <= b0_val) && !(z_req_up == 1)) && 1 <= b0_val_t) && 2 <= d1_ev) && 1 <= d1_val_t) && 1 <= b1_val_t) && 2 <= b1_ev) && d1_req_up == 1) && 0 == z_val_t) && z_val <= 0) && b0_ev == 0) && 1 <= d0_val) && 1 <= d0_val_t) && b0_req_up <= 0) && d0_ev == 0) && b1_req_up <= 0) && 2 <= z_ev) && 1 <= b1_val) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. SAFE Result, 32.7s OverallTime, 28 OverallIterations, 2 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 20.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 4817 SDtfs, 2727 SDslu, 3234 SDs, 0 SdLazy, 298 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1628occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 3126 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 366 NumberOfFragments, 5986 HoareAnnotationTreeSize, 33 FomulaSimplifications, 62607 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 33 FomulaSimplificationsInter, 32353 FormulaSimplificationTreeSizeReductionInter, 18.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2277 NumberOfCodeBlocks, 2277 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2248 ConstructedInterpolants, 0 QuantifiedInterpolants, 343948 SizeOfPredicates, 1 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 29 InterpolantComputations, 28 PerfectInterpolantSequences, 54/60 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...