./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 0ed9222f 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-0ed9222-m [2019-01-12 15:28:59,767 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:28:59,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:28:59,781 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:28:59,781 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:28:59,782 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:28:59,784 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:28:59,786 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:28:59,790 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:28:59,791 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:28:59,792 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:28:59,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:28:59,794 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:28:59,796 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:28:59,797 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:28:59,801 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:28:59,802 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:28:59,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:28:59,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:28:59,814 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:28:59,818 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:28:59,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:28:59,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:28:59,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:28:59,828 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:28:59,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:28:59,830 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:28:59,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:28:59,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:28:59,835 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:28:59,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:28:59,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:28:59,836 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:28:59,836 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:28:59,837 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:28:59,838 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:28:59,838 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:28:59,862 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:28:59,862 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:28:59,864 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:28:59,864 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:28:59,864 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:28:59,864 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:28:59,864 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:28:59,865 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:28:59,867 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:28:59,867 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:28:59,867 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:28:59,867 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:28:59,867 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:28:59,868 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:28:59,868 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:28:59,869 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:28:59,869 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:28:59,869 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:28:59,869 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:28:59,869 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:28:59,870 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:28:59,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:28:59,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:28:59,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:28:59,872 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:28:59,872 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:28:59,873 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:28:59,873 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:28:59,874 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 [2019-01-12 15:28:59,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:28:59,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:28:59,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:28:59,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:28:59,941 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:28:59,942 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2019-01-12 15:28:59,999 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574b99e88/ca14ef8072914f1297cddeca06a04136/FLAGd16107abd [2019-01-12 15:29:00,488 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:29:00,489 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2019-01-12 15:29:00,502 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574b99e88/ca14ef8072914f1297cddeca06a04136/FLAGd16107abd [2019-01-12 15:29:00,838 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574b99e88/ca14ef8072914f1297cddeca06a04136 [2019-01-12 15:29:00,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:29:00,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:29:00,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:29:00,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:29:00,848 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:29:00,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:29:00" (1/1) ... [2019-01-12 15:29:00,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0e8c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:00, skipping insertion in model container [2019-01-12 15:29:00,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:29:00" (1/1) ... [2019-01-12 15:29:00,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:29:00,899 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:29:01,088 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:29:01,095 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:29:01,140 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:29:01,162 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:29:01,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01 WrapperNode [2019-01-12 15:29:01,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:29:01,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:29:01,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:29:01,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:29:01,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (1/1) ... [2019-01-12 15:29:01,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (1/1) ... [2019-01-12 15:29:01,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:29:01,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:29:01,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:29:01,244 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:29:01,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (1/1) ... [2019-01-12 15:29:01,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (1/1) ... [2019-01-12 15:29:01,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (1/1) ... [2019-01-12 15:29:01,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (1/1) ... [2019-01-12 15:29:01,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (1/1) ... [2019-01-12 15:29:01,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (1/1) ... [2019-01-12 15:29:01,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (1/1) ... [2019-01-12 15:29:01,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:29:01,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:29:01,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:29:01,349 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:29:01,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:29:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:29:01,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:29:02,391 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:29:02,391 INFO L286 CfgBuilder]: Removed 64 assue(true) statements. [2019-01-12 15:29:02,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:29:02 BoogieIcfgContainer [2019-01-12 15:29:02,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:29:02,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:29:02,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:29:02,398 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:29:02,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:29:00" (1/3) ... [2019-01-12 15:29:02,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39128676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:29:02, skipping insertion in model container [2019-01-12 15:29:02,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:29:01" (2/3) ... [2019-01-12 15:29:02,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39128676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:29:02, skipping insertion in model container [2019-01-12 15:29:02,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:29:02" (3/3) ... [2019-01-12 15:29:02,403 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell_true-unreach-call_false-termination.cil.c [2019-01-12 15:29:02,414 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:29:02,424 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:29:02,438 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:29:02,470 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:29:02,471 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:29:02,471 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:29:02,471 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:29:02,472 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:29:02,472 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:29:02,472 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:29:02,472 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:29:02,472 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:29:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-01-12 15:29:02,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 15:29:02,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:02,500 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] [2019-01-12 15:29:02,502 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:02,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:02,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2133595601, now seen corresponding path program 1 times [2019-01-12 15:29:02,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:02,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:02,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:02,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:02,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:02,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:02,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:02,700 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 3 states. [2019-01-12 15:29:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:02,785 INFO L93 Difference]: Finished difference Result 210 states and 352 transitions. [2019-01-12 15:29:02,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:02,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-01-12 15:29:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:02,800 INFO L225 Difference]: With dead ends: 210 [2019-01-12 15:29:02,800 INFO L226 Difference]: Without dead ends: 104 [2019-01-12 15:29:02,804 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 [2019-01-12 15:29:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-12 15:29:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-12 15:29:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 15:29:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 170 transitions. [2019-01-12 15:29:02,851 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 170 transitions. Word has length 27 [2019-01-12 15:29:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:02,852 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 170 transitions. [2019-01-12 15:29:02,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 170 transitions. [2019-01-12 15:29:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-12 15:29:02,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:02,856 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] [2019-01-12 15:29:02,856 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:02,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:02,857 INFO L82 PathProgramCache]: Analyzing trace with hash 431895830, now seen corresponding path program 1 times [2019-01-12 15:29:02,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:02,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:02,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:02,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:02,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:02,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:02,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:02,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:02,971 INFO L87 Difference]: Start difference. First operand 104 states and 170 transitions. Second operand 3 states. [2019-01-12 15:29:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:03,049 INFO L93 Difference]: Finished difference Result 199 states and 328 transitions. [2019-01-12 15:29:03,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:03,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-01-12 15:29:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:03,053 INFO L225 Difference]: With dead ends: 199 [2019-01-12 15:29:03,055 INFO L226 Difference]: Without dead ends: 104 [2019-01-12 15:29:03,059 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 [2019-01-12 15:29:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-12 15:29:03,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-12 15:29:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 15:29:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2019-01-12 15:29:03,085 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 66 [2019-01-12 15:29:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:03,086 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2019-01-12 15:29:03,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2019-01-12 15:29:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-12 15:29:03,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:03,091 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] [2019-01-12 15:29:03,091 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:03,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:03,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1220222108, now seen corresponding path program 1 times [2019-01-12 15:29:03,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:03,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:03,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:03,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:03,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:03,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:03,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:03,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:03,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:03,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:03,177 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2019-01-12 15:29:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:03,244 INFO L93 Difference]: Finished difference Result 196 states and 322 transitions. [2019-01-12 15:29:03,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:03,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-01-12 15:29:03,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:03,248 INFO L225 Difference]: With dead ends: 196 [2019-01-12 15:29:03,248 INFO L226 Difference]: Without dead ends: 104 [2019-01-12 15:29:03,249 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 [2019-01-12 15:29:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-12 15:29:03,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-12 15:29:03,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 15:29:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 168 transitions. [2019-01-12 15:29:03,264 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 168 transitions. Word has length 68 [2019-01-12 15:29:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:03,264 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 168 transitions. [2019-01-12 15:29:03,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 168 transitions. [2019-01-12 15:29:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-12 15:29:03,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:03,271 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] [2019-01-12 15:29:03,272 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:03,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2086729770, now seen corresponding path program 1 times [2019-01-12 15:29:03,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:03,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:03,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:03,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:03,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:03,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:03,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:03,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:03,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:03,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:03,369 INFO L87 Difference]: Start difference. First operand 104 states and 168 transitions. Second operand 3 states. [2019-01-12 15:29:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:03,412 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-01-12 15:29:03,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:03,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-01-12 15:29:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:03,418 INFO L225 Difference]: With dead ends: 193 [2019-01-12 15:29:03,419 INFO L226 Difference]: Without dead ends: 104 [2019-01-12 15:29:03,420 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 [2019-01-12 15:29:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-12 15:29:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-12 15:29:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 15:29:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 167 transitions. [2019-01-12 15:29:03,435 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 167 transitions. Word has length 70 [2019-01-12 15:29:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:03,435 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 167 transitions. [2019-01-12 15:29:03,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 167 transitions. [2019-01-12 15:29:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:29:03,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:03,441 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] [2019-01-12 15:29:03,441 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:03,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:03,442 INFO L82 PathProgramCache]: Analyzing trace with hash 541706460, now seen corresponding path program 1 times [2019-01-12 15:29:03,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:03,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:03,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:03,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:03,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:03,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:03,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:03,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:03,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:03,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:03,562 INFO L87 Difference]: Start difference. First operand 104 states and 167 transitions. Second operand 3 states. [2019-01-12 15:29:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:03,771 INFO L93 Difference]: Finished difference Result 271 states and 442 transitions. [2019-01-12 15:29:03,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:03,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:29:03,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:03,776 INFO L225 Difference]: With dead ends: 271 [2019-01-12 15:29:03,777 INFO L226 Difference]: Without dead ends: 191 [2019-01-12 15:29:03,777 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 [2019-01-12 15:29:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-12 15:29:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-01-12 15:29:03,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-01-12 15:29:03,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 305 transitions. [2019-01-12 15:29:03,796 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 305 transitions. Word has length 72 [2019-01-12 15:29:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:03,798 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 305 transitions. [2019-01-12 15:29:03,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 305 transitions. [2019-01-12 15:29:03,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:29:03,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:03,801 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] [2019-01-12 15:29:03,801 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:03,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:03,803 INFO L82 PathProgramCache]: Analyzing trace with hash 60533476, now seen corresponding path program 1 times [2019-01-12 15:29:03,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:03,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:03,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:03,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:03,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:03,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:03,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:03,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:03,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:03,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:03,886 INFO L87 Difference]: Start difference. First operand 188 states and 305 transitions. Second operand 3 states. [2019-01-12 15:29:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:04,124 INFO L93 Difference]: Finished difference Result 536 states and 876 transitions. [2019-01-12 15:29:04,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:04,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:29:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:04,130 INFO L225 Difference]: With dead ends: 536 [2019-01-12 15:29:04,130 INFO L226 Difference]: Without dead ends: 371 [2019-01-12 15:29:04,132 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 [2019-01-12 15:29:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-01-12 15:29:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2019-01-12 15:29:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-01-12 15:29:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 590 transitions. [2019-01-12 15:29:04,180 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 590 transitions. Word has length 72 [2019-01-12 15:29:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:04,180 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 590 transitions. [2019-01-12 15:29:04,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:04,184 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 590 transitions. [2019-01-12 15:29:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-12 15:29:04,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:04,187 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] [2019-01-12 15:29:04,190 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:04,191 INFO L82 PathProgramCache]: Analyzing trace with hash 954019814, now seen corresponding path program 1 times [2019-01-12 15:29:04,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:04,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:04,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:04,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:04,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:04,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:04,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:04,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:04,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:04,310 INFO L87 Difference]: Start difference. First operand 368 states and 590 transitions. Second operand 3 states. [2019-01-12 15:29:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:04,551 INFO L93 Difference]: Finished difference Result 697 states and 1126 transitions. [2019-01-12 15:29:04,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:04,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-01-12 15:29:04,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:04,557 INFO L225 Difference]: With dead ends: 697 [2019-01-12 15:29:04,557 INFO L226 Difference]: Without dead ends: 408 [2019-01-12 15:29:04,558 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 [2019-01-12 15:29:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-01-12 15:29:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2019-01-12 15:29:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-01-12 15:29:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 648 transitions. [2019-01-12 15:29:04,595 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 648 transitions. Word has length 72 [2019-01-12 15:29:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:04,596 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 648 transitions. [2019-01-12 15:29:04,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 648 transitions. [2019-01-12 15:29:04,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 15:29:04,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:04,599 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] [2019-01-12 15:29:04,599 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:04,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:04,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1501854766, now seen corresponding path program 1 times [2019-01-12 15:29:04,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:04,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:04,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:04,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:04,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:04,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:04,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:04,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:04,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:04,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:04,699 INFO L87 Difference]: Start difference. First operand 408 states and 648 transitions. Second operand 3 states. [2019-01-12 15:29:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:04,960 INFO L93 Difference]: Finished difference Result 1166 states and 1860 transitions. [2019-01-12 15:29:04,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:04,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-12 15:29:04,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:04,966 INFO L225 Difference]: With dead ends: 1166 [2019-01-12 15:29:04,966 INFO L226 Difference]: Without dead ends: 805 [2019-01-12 15:29:04,968 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 [2019-01-12 15:29:04,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-01-12 15:29:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 802. [2019-01-12 15:29:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2019-01-12 15:29:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1252 transitions. [2019-01-12 15:29:05,002 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1252 transitions. Word has length 73 [2019-01-12 15:29:05,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:05,002 INFO L480 AbstractCegarLoop]: Abstraction has 802 states and 1252 transitions. [2019-01-12 15:29:05,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:05,003 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1252 transitions. [2019-01-12 15:29:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 15:29:05,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:05,007 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] [2019-01-12 15:29:05,007 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:05,007 INFO L82 PathProgramCache]: Analyzing trace with hash -608368428, now seen corresponding path program 1 times [2019-01-12 15:29:05,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:05,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:05,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:05,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:05,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:05,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:05,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:05,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:05,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:05,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:05,054 INFO L87 Difference]: Start difference. First operand 802 states and 1252 transitions. Second operand 3 states. [2019-01-12 15:29:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:05,400 INFO L93 Difference]: Finished difference Result 1533 states and 2406 transitions. [2019-01-12 15:29:05,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:05,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-12 15:29:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:05,411 INFO L225 Difference]: With dead ends: 1533 [2019-01-12 15:29:05,411 INFO L226 Difference]: Without dead ends: 926 [2019-01-12 15:29:05,414 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 [2019-01-12 15:29:05,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-01-12 15:29:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-01-12 15:29:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-01-12 15:29:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1426 transitions. [2019-01-12 15:29:05,471 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1426 transitions. Word has length 73 [2019-01-12 15:29:05,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:05,471 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 1426 transitions. [2019-01-12 15:29:05,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1426 transitions. [2019-01-12 15:29:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 15:29:05,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:05,477 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] [2019-01-12 15:29:05,478 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash 778416982, now seen corresponding path program 1 times [2019-01-12 15:29:05,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:05,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:05,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:05,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:05,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:05,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:05,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:05,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:05,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:05,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:05,591 INFO L87 Difference]: Start difference. First operand 926 states and 1426 transitions. Second operand 3 states. [2019-01-12 15:29:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:05,861 INFO L93 Difference]: Finished difference Result 1353 states and 2078 transitions. [2019-01-12 15:29:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:05,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-12 15:29:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:05,867 INFO L225 Difference]: With dead ends: 1353 [2019-01-12 15:29:05,867 INFO L226 Difference]: Without dead ends: 622 [2019-01-12 15:29:05,870 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 [2019-01-12 15:29:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-01-12 15:29:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 622. [2019-01-12 15:29:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-01-12 15:29:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 924 transitions. [2019-01-12 15:29:05,895 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 924 transitions. Word has length 73 [2019-01-12 15:29:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:05,896 INFO L480 AbstractCegarLoop]: Abstraction has 622 states and 924 transitions. [2019-01-12 15:29:05,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 924 transitions. [2019-01-12 15:29:05,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-12 15:29:05,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:05,902 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] [2019-01-12 15:29:05,905 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:05,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:05,906 INFO L82 PathProgramCache]: Analyzing trace with hash -936880108, now seen corresponding path program 1 times [2019-01-12 15:29:05,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:05,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:05,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:05,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:05,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:05,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:05,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:05,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:05,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:05,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:05,998 INFO L87 Difference]: Start difference. First operand 622 states and 924 transitions. Second operand 3 states. [2019-01-12 15:29:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:06,256 INFO L93 Difference]: Finished difference Result 921 states and 1366 transitions. [2019-01-12 15:29:06,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:06,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-01-12 15:29:06,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:06,262 INFO L225 Difference]: With dead ends: 921 [2019-01-12 15:29:06,262 INFO L226 Difference]: Without dead ends: 442 [2019-01-12 15:29:06,264 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 [2019-01-12 15:29:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-01-12 15:29:06,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2019-01-12 15:29:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-01-12 15:29:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 636 transitions. [2019-01-12 15:29:06,293 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 636 transitions. Word has length 73 [2019-01-12 15:29:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:06,293 INFO L480 AbstractCegarLoop]: Abstraction has 442 states and 636 transitions. [2019-01-12 15:29:06,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 636 transitions. [2019-01-12 15:29:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-12 15:29:06,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:06,297 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] [2019-01-12 15:29:06,297 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1482058010, now seen corresponding path program 1 times [2019-01-12 15:29:06,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:06,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:06,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:06,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:06,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:06,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:06,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:06,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:06,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:06,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:06,404 INFO L87 Difference]: Start difference. First operand 442 states and 636 transitions. Second operand 3 states. [2019-01-12 15:29:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:06,482 INFO L93 Difference]: Finished difference Result 617 states and 897 transitions. [2019-01-12 15:29:06,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:06,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-01-12 15:29:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:06,487 INFO L225 Difference]: With dead ends: 617 [2019-01-12 15:29:06,487 INFO L226 Difference]: Without dead ends: 344 [2019-01-12 15:29:06,489 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 [2019-01-12 15:29:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-12 15:29:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-01-12 15:29:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-01-12 15:29:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 492 transitions. [2019-01-12 15:29:06,536 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 492 transitions. Word has length 74 [2019-01-12 15:29:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:06,539 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 492 transitions. [2019-01-12 15:29:06,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 492 transitions. [2019-01-12 15:29:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-12 15:29:06,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:06,541 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] [2019-01-12 15:29:06,543 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:06,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:06,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1686276329, now seen corresponding path program 1 times [2019-01-12 15:29:06,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:06,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:06,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:06,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:06,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:06,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:06,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:06,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:06,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:06,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:06,636 INFO L87 Difference]: Start difference. First operand 344 states and 492 transitions. Second operand 3 states. [2019-01-12 15:29:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:07,007 INFO L93 Difference]: Finished difference Result 922 states and 1324 transitions. [2019-01-12 15:29:07,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:07,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-01-12 15:29:07,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:07,013 INFO L225 Difference]: With dead ends: 922 [2019-01-12 15:29:07,013 INFO L226 Difference]: Without dead ends: 665 [2019-01-12 15:29:07,014 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 [2019-01-12 15:29:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-01-12 15:29:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 662. [2019-01-12 15:29:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-01-12 15:29:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 932 transitions. [2019-01-12 15:29:07,049 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 932 transitions. Word has length 74 [2019-01-12 15:29:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:07,049 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 932 transitions. [2019-01-12 15:29:07,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 932 transitions. [2019-01-12 15:29:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-12 15:29:07,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:07,054 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] [2019-01-12 15:29:07,054 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:07,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:07,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1715204629, now seen corresponding path program 1 times [2019-01-12 15:29:07,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:07,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:07,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:07,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:07,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:07,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:07,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:07,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:07,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:07,132 INFO L87 Difference]: Start difference. First operand 662 states and 932 transitions. Second operand 3 states. [2019-01-12 15:29:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:07,439 INFO L93 Difference]: Finished difference Result 1151 states and 1632 transitions. [2019-01-12 15:29:07,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:07,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-01-12 15:29:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:07,446 INFO L225 Difference]: With dead ends: 1151 [2019-01-12 15:29:07,446 INFO L226 Difference]: Without dead ends: 782 [2019-01-12 15:29:07,447 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 [2019-01-12 15:29:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-01-12 15:29:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2019-01-12 15:29:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-01-12 15:29:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1082 transitions. [2019-01-12 15:29:07,487 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1082 transitions. Word has length 74 [2019-01-12 15:29:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:07,489 INFO L480 AbstractCegarLoop]: Abstraction has 782 states and 1082 transitions. [2019-01-12 15:29:07,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1082 transitions. [2019-01-12 15:29:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-12 15:29:07,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:07,493 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] [2019-01-12 15:29:07,493 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:07,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:07,493 INFO L82 PathProgramCache]: Analyzing trace with hash -328419219, now seen corresponding path program 1 times [2019-01-12 15:29:07,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:07,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:07,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:07,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:07,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:07,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:07,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:07,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:07,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:07,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:07,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:07,568 INFO L87 Difference]: Start difference. First operand 782 states and 1082 transitions. Second operand 3 states. [2019-01-12 15:29:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:07,836 INFO L93 Difference]: Finished difference Result 1061 states and 1472 transitions. [2019-01-12 15:29:07,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:07,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-01-12 15:29:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:07,843 INFO L225 Difference]: With dead ends: 1061 [2019-01-12 15:29:07,843 INFO L226 Difference]: Without dead ends: 572 [2019-01-12 15:29:07,845 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 [2019-01-12 15:29:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-01-12 15:29:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-01-12 15:29:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-01-12 15:29:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 766 transitions. [2019-01-12 15:29:07,876 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 766 transitions. Word has length 74 [2019-01-12 15:29:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:07,877 INFO L480 AbstractCegarLoop]: Abstraction has 572 states and 766 transitions. [2019-01-12 15:29:07,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:07,878 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 766 transitions. [2019-01-12 15:29:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 15:29:07,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:07,880 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] [2019-01-12 15:29:07,881 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:07,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash -524997684, now seen corresponding path program 1 times [2019-01-12 15:29:07,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:07,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:07,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:07,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:07,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:07,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:07,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:07,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:07,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:07,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:07,984 INFO L87 Difference]: Start difference. First operand 572 states and 766 transitions. Second operand 3 states. [2019-01-12 15:29:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:08,075 INFO L93 Difference]: Finished difference Result 741 states and 1005 transitions. [2019-01-12 15:29:08,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:08,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-01-12 15:29:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:08,081 INFO L225 Difference]: With dead ends: 741 [2019-01-12 15:29:08,082 INFO L226 Difference]: Without dead ends: 478 [2019-01-12 15:29:08,083 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 [2019-01-12 15:29:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-01-12 15:29:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 478. [2019-01-12 15:29:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-01-12 15:29:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 638 transitions. [2019-01-12 15:29:08,118 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 638 transitions. Word has length 75 [2019-01-12 15:29:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:08,119 INFO L480 AbstractCegarLoop]: Abstraction has 478 states and 638 transitions. [2019-01-12 15:29:08,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 638 transitions. [2019-01-12 15:29:08,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 15:29:08,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:08,122 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] [2019-01-12 15:29:08,123 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:08,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1795209225, now seen corresponding path program 1 times [2019-01-12 15:29:08,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:08,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:08,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:08,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:08,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:08,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:08,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:08,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:08,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:08,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:08,207 INFO L87 Difference]: Start difference. First operand 478 states and 638 transitions. Second operand 3 states. [2019-01-12 15:29:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:08,606 INFO L93 Difference]: Finished difference Result 1220 states and 1622 transitions. [2019-01-12 15:29:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:08,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-01-12 15:29:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:08,612 INFO L225 Difference]: With dead ends: 1220 [2019-01-12 15:29:08,612 INFO L226 Difference]: Without dead ends: 909 [2019-01-12 15:29:08,613 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 [2019-01-12 15:29:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-01-12 15:29:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 906. [2019-01-12 15:29:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 906 states. [2019-01-12 15:29:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1184 transitions. [2019-01-12 15:29:08,659 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1184 transitions. Word has length 75 [2019-01-12 15:29:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:08,660 INFO L480 AbstractCegarLoop]: Abstraction has 906 states and 1184 transitions. [2019-01-12 15:29:08,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1184 transitions. [2019-01-12 15:29:08,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 15:29:08,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:08,664 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] [2019-01-12 15:29:08,664 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:08,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash 810814329, now seen corresponding path program 1 times [2019-01-12 15:29:08,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:08,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:08,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:08,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:08,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:08,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:08,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:08,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:08,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:08,740 INFO L87 Difference]: Start difference. First operand 906 states and 1184 transitions. Second operand 3 states. [2019-01-12 15:29:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:08,892 INFO L93 Difference]: Finished difference Result 1075 states and 1414 transitions. [2019-01-12 15:29:08,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:08,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-01-12 15:29:08,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:08,899 INFO L225 Difference]: With dead ends: 1075 [2019-01-12 15:29:08,900 INFO L226 Difference]: Without dead ends: 1072 [2019-01-12 15:29:08,901 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 [2019-01-12 15:29:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-01-12 15:29:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2019-01-12 15:29:08,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2019-01-12 15:29:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1410 transitions. [2019-01-12 15:29:08,954 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1410 transitions. Word has length 75 [2019-01-12 15:29:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:08,955 INFO L480 AbstractCegarLoop]: Abstraction has 1072 states and 1410 transitions. [2019-01-12 15:29:08,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1410 transitions. [2019-01-12 15:29:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-12 15:29:08,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:08,960 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] [2019-01-12 15:29:08,961 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:08,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:08,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1383852991, now seen corresponding path program 1 times [2019-01-12 15:29:08,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:08,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:08,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:08,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:08,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:09,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:09,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:09,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:09,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:09,045 INFO L87 Difference]: Start difference. First operand 1072 states and 1410 transitions. Second operand 3 states. [2019-01-12 15:29:09,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:09,225 INFO L93 Difference]: Finished difference Result 1999 states and 2700 transitions. [2019-01-12 15:29:09,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:09,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-01-12 15:29:09,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:09,233 INFO L225 Difference]: With dead ends: 1999 [2019-01-12 15:29:09,234 INFO L226 Difference]: Without dead ends: 1006 [2019-01-12 15:29:09,237 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 [2019-01-12 15:29:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-01-12 15:29:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 940. [2019-01-12 15:29:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-01-12 15:29:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1246 transitions. [2019-01-12 15:29:09,301 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1246 transitions. Word has length 77 [2019-01-12 15:29:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:09,302 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1246 transitions. [2019-01-12 15:29:09,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1246 transitions. [2019-01-12 15:29:09,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-12 15:29:09,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:09,308 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] [2019-01-12 15:29:09,310 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1984147797, now seen corresponding path program 1 times [2019-01-12 15:29:09,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:09,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:09,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:09,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:09,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:09,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:09,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:29:09,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:29:09,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:29:09,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:29:09,472 INFO L87 Difference]: Start difference. First operand 940 states and 1246 transitions. Second operand 4 states. [2019-01-12 15:29:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:09,695 INFO L93 Difference]: Finished difference Result 1579 states and 2134 transitions. [2019-01-12 15:29:09,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:29:09,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-01-12 15:29:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:09,702 INFO L225 Difference]: With dead ends: 1579 [2019-01-12 15:29:09,702 INFO L226 Difference]: Without dead ends: 940 [2019-01-12 15:29:09,703 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 [2019-01-12 15:29:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-01-12 15:29:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-01-12 15:29:09,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-01-12 15:29:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1240 transitions. [2019-01-12 15:29:09,768 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1240 transitions. Word has length 91 [2019-01-12 15:29:09,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:09,768 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1240 transitions. [2019-01-12 15:29:09,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:29:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1240 transitions. [2019-01-12 15:29:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 15:29:09,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:09,774 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] [2019-01-12 15:29:09,774 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:09,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:09,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1157899978, now seen corresponding path program 1 times [2019-01-12 15:29:09,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:09,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:09,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:09,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:09,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:09,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:09,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:29:09,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:29:09,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:29:09,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:29:09,959 INFO L87 Difference]: Start difference. First operand 940 states and 1240 transitions. Second operand 4 states. [2019-01-12 15:29:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:10,256 INFO L93 Difference]: Finished difference Result 1579 states and 2122 transitions. [2019-01-12 15:29:10,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:29:10,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-12 15:29:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:10,265 INFO L225 Difference]: With dead ends: 1579 [2019-01-12 15:29:10,266 INFO L226 Difference]: Without dead ends: 940 [2019-01-12 15:29:10,267 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 [2019-01-12 15:29:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-01-12 15:29:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-01-12 15:29:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-01-12 15:29:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1234 transitions. [2019-01-12 15:29:10,331 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1234 transitions. Word has length 92 [2019-01-12 15:29:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:10,333 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1234 transitions. [2019-01-12 15:29:10,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:29:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1234 transitions. [2019-01-12 15:29:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 15:29:10,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:10,336 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] [2019-01-12 15:29:10,337 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:10,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 433852849, now seen corresponding path program 1 times [2019-01-12 15:29:10,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:10,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:10,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:10,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:10,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:10,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:10,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:10,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:10,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:10,414 INFO L87 Difference]: Start difference. First operand 940 states and 1234 transitions. Second operand 3 states. [2019-01-12 15:29:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:10,599 INFO L93 Difference]: Finished difference Result 2176 states and 2914 transitions. [2019-01-12 15:29:10,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:10,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-01-12 15:29:10,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:10,609 INFO L225 Difference]: With dead ends: 2176 [2019-01-12 15:29:10,609 INFO L226 Difference]: Without dead ends: 1537 [2019-01-12 15:29:10,611 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 [2019-01-12 15:29:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2019-01-12 15:29:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 958. [2019-01-12 15:29:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-01-12 15:29:10,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1252 transitions. [2019-01-12 15:29:10,683 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1252 transitions. Word has length 93 [2019-01-12 15:29:10,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:10,683 INFO L480 AbstractCegarLoop]: Abstraction has 958 states and 1252 transitions. [2019-01-12 15:29:10,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:10,684 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1252 transitions. [2019-01-12 15:29:10,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-12 15:29:10,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:10,688 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] [2019-01-12 15:29:10,688 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:10,688 INFO L82 PathProgramCache]: Analyzing trace with hash 124550695, now seen corresponding path program 1 times [2019-01-12 15:29:10,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:10,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:10,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:10,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:10,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:10,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:10,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:29:10,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:29:10,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:29:10,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:29:10,851 INFO L87 Difference]: Start difference. First operand 958 states and 1252 transitions. Second operand 4 states. [2019-01-12 15:29:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:11,037 INFO L93 Difference]: Finished difference Result 1591 states and 2098 transitions. [2019-01-12 15:29:11,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:29:11,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-01-12 15:29:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:11,044 INFO L225 Difference]: With dead ends: 1591 [2019-01-12 15:29:11,044 INFO L226 Difference]: Without dead ends: 934 [2019-01-12 15:29:11,045 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 [2019-01-12 15:29:11,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-01-12 15:29:11,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2019-01-12 15:29:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-01-12 15:29:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1198 transitions. [2019-01-12 15:29:11,106 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1198 transitions. Word has length 94 [2019-01-12 15:29:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:11,107 INFO L480 AbstractCegarLoop]: Abstraction has 934 states and 1198 transitions. [2019-01-12 15:29:11,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:29:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1198 transitions. [2019-01-12 15:29:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:29:11,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:11,111 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] [2019-01-12 15:29:11,111 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:11,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:11,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2108597088, now seen corresponding path program 1 times [2019-01-12 15:29:11,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:11,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:11,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:11,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:11,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:11,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:11,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:11,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:11,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:11,182 INFO L87 Difference]: Start difference. First operand 934 states and 1198 transitions. Second operand 3 states. [2019-01-12 15:29:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:11,374 INFO L93 Difference]: Finished difference Result 2188 states and 2860 transitions. [2019-01-12 15:29:11,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:11,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-01-12 15:29:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:11,384 INFO L225 Difference]: With dead ends: 2188 [2019-01-12 15:29:11,384 INFO L226 Difference]: Without dead ends: 1555 [2019-01-12 15:29:11,387 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 [2019-01-12 15:29:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-01-12 15:29:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 958. [2019-01-12 15:29:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2019-01-12 15:29:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1222 transitions. [2019-01-12 15:29:11,466 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1222 transitions. Word has length 95 [2019-01-12 15:29:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:11,466 INFO L480 AbstractCegarLoop]: Abstraction has 958 states and 1222 transitions. [2019-01-12 15:29:11,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:11,467 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1222 transitions. [2019-01-12 15:29:11,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:29:11,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:11,471 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] [2019-01-12 15:29:11,471 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:11,471 INFO L82 PathProgramCache]: Analyzing trace with hash -169435042, now seen corresponding path program 1 times [2019-01-12 15:29:11,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:11,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:11,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:11,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:11,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:11,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:11,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:11,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:11,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:11,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:11,550 INFO L87 Difference]: Start difference. First operand 958 states and 1222 transitions. Second operand 3 states. [2019-01-12 15:29:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:11,773 INFO L93 Difference]: Finished difference Result 2220 states and 2810 transitions. [2019-01-12 15:29:11,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:11,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-01-12 15:29:11,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:11,783 INFO L225 Difference]: With dead ends: 2220 [2019-01-12 15:29:11,783 INFO L226 Difference]: Without dead ends: 1563 [2019-01-12 15:29:11,785 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 [2019-01-12 15:29:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-01-12 15:29:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1560. [2019-01-12 15:29:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-01-12 15:29:11,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1914 transitions. [2019-01-12 15:29:11,907 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1914 transitions. Word has length 95 [2019-01-12 15:29:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:11,907 INFO L480 AbstractCegarLoop]: Abstraction has 1560 states and 1914 transitions. [2019-01-12 15:29:11,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1914 transitions. [2019-01-12 15:29:11,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:29:11,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:11,913 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] [2019-01-12 15:29:11,914 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash 254211680, now seen corresponding path program 1 times [2019-01-12 15:29:11,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:11,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:11,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:11,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:12,317 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-01-12 15:29:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:12,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:29:12,343 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 [2019-01-12 15:29:12,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:12,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:29:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:12,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 15:29:12,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-01-12 15:29:12,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:29:12,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:29:12,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:29:12,769 INFO L87 Difference]: Start difference. First operand 1560 states and 1914 transitions. Second operand 5 states. [2019-01-12 15:29:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:13,395 INFO L93 Difference]: Finished difference Result 3204 states and 3972 transitions. [2019-01-12 15:29:13,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:29:13,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-01-12 15:29:13,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:13,409 INFO L225 Difference]: With dead ends: 3204 [2019-01-12 15:29:13,410 INFO L226 Difference]: Without dead ends: 2501 [2019-01-12 15:29:13,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:29:13,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2019-01-12 15:29:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 1610. [2019-01-12 15:29:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2019-01-12 15:29:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 1982 transitions. [2019-01-12 15:29:13,659 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 1982 transitions. Word has length 95 [2019-01-12 15:29:13,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:13,659 INFO L480 AbstractCegarLoop]: Abstraction has 1610 states and 1982 transitions. [2019-01-12 15:29:13,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:29:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 1982 transitions. [2019-01-12 15:29:13,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:29:13,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:13,664 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] [2019-01-12 15:29:13,665 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:13,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1147698018, now seen corresponding path program 1 times [2019-01-12 15:29:13,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:13,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:13,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:13,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:13,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:13,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:13,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 15:29:13,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 15:29:13,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 15:29:13,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 15:29:13,757 INFO L87 Difference]: Start difference. First operand 1610 states and 1982 transitions. Second operand 3 states. [2019-01-12 15:29:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:14,177 INFO L93 Difference]: Finished difference Result 3706 states and 4622 transitions. [2019-01-12 15:29:14,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 15:29:14,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-01-12 15:29:14,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:14,193 INFO L225 Difference]: With dead ends: 3706 [2019-01-12 15:29:14,194 INFO L226 Difference]: Without dead ends: 2603 [2019-01-12 15:29:14,196 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 [2019-01-12 15:29:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2019-01-12 15:29:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1628. [2019-01-12 15:29:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-01-12 15:29:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2000 transitions. [2019-01-12 15:29:14,467 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2000 transitions. Word has length 95 [2019-01-12 15:29:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:14,468 INFO L480 AbstractCegarLoop]: Abstraction has 1628 states and 2000 transitions. [2019-01-12 15:29:14,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 15:29:14,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2000 transitions. [2019-01-12 15:29:14,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-12 15:29:14,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:29:14,473 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] [2019-01-12 15:29:14,473 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:29:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:29:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash 746876002, now seen corresponding path program 1 times [2019-01-12 15:29:14,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:29:14,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:29:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:14,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:29:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:29:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:29:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:29:14,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:29:14,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 15:29:14,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 15:29:14,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 15:29:14,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 15:29:14,615 INFO L87 Difference]: Start difference. First operand 1628 states and 2000 transitions. Second operand 4 states. [2019-01-12 15:29:14,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:29:14,941 INFO L93 Difference]: Finished difference Result 1970 states and 2418 transitions. [2019-01-12 15:29:14,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 15:29:14,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-01-12 15:29:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:29:14,943 INFO L225 Difference]: With dead ends: 1970 [2019-01-12 15:29:14,943 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:29:14,947 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 [2019-01-12 15:29:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:29:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:29:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:29:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:29:14,948 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-01-12 15:29:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:29:14,949 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:29:14,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 15:29:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:29:14,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:29:14,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:29:14,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:14,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,104 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2019-01-12 15:29:15,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,282 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2019-01-12 15:29:15,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,647 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 118 [2019-01-12 15:29:15,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,838 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-01-12 15:29:15,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:15,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,094 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2019-01-12 15:29:16,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,333 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2019-01-12 15:29:16,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,501 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2019-01-12 15:29:16,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:16,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,238 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 110 [2019-01-12 15:29:17,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 15:29:17,571 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 118 [2019-01-12 15:29:20,465 WARN L181 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2019-01-12 15:29:22,198 WARN L181 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-01-12 15:29:22,721 WARN L181 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 44 [2019-01-12 15:29:23,186 WARN L181 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-01-12 15:29:23,418 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-01-12 15:29:24,302 WARN L181 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-01-12 15:29:24,636 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-01-12 15:29:24,965 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-01-12 15:29:25,672 WARN L181 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-01-12 15:29:25,899 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-01-12 15:29:26,249 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-01-12 15:29:26,475 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-01-12 15:29:26,880 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 44 [2019-01-12 15:29:27,426 WARN L181 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 44 [2019-01-12 15:29:27,918 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-01-12 15:29:28,676 WARN L181 SmtUtils]: Spent 756.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-01-12 15:29:28,956 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-01-12 15:29:29,844 WARN L181 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-01-12 15:29:30,167 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-01-12 15:29:30,551 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-01-12 15:29:30,870 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 45 [2019-01-12 15:29:31,076 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-12 15:29:31,759 WARN L181 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-01-12 15:29:31,986 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-01-12 15:29:32,695 WARN L181 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-01-12 15:29:33,173 WARN L181 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 44 [2019-01-12 15:29:33,898 WARN L181 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-01-12 15:29:34,624 WARN L181 SmtUtils]: Spent 724.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2019-01-12 15:29:35,361 WARN L181 SmtUtils]: Spent 735.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-01-12 15:29:35,365 INFO L448 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2019-01-12 15:29:35,366 INFO L451 ceAbstractionStarter]: At program point L499(lines 483 501) the Hoare annotation is: true [2019-01-12 15:29:35,366 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))) [2019-01-12 15:29:35,366 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 208) no Hoare annotation was computed. [2019-01-12 15:29:35,366 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))) [2019-01-12 15:29:35,366 INFO L448 ceAbstractionStarter]: For program point L202-2(lines 202 208) no Hoare annotation was computed. [2019-01-12 15:29:35,367 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))) [2019-01-12 15:29:35,367 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2019-01-12 15:29:35,367 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2019-01-12 15:29:35,367 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 105 115) no Hoare annotation was computed. [2019-01-12 15:29:35,367 INFO L448 ceAbstractionStarter]: For program point L172(lines 172 177) no Hoare annotation was computed. [2019-01-12 15:29:35,367 INFO L448 ceAbstractionStarter]: For program point L172-2(lines 172 177) no Hoare annotation was computed. [2019-01-12 15:29:35,367 INFO L448 ceAbstractionStarter]: For program point L172-3(lines 172 177) no Hoare annotation was computed. [2019-01-12 15:29:35,367 INFO L448 ceAbstractionStarter]: For program point L172-5(lines 172 177) no Hoare annotation was computed. [2019-01-12 15:29:35,373 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)) [2019-01-12 15:29:35,373 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)) [2019-01-12 15:29:35,373 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2019-01-12 15:29:35,373 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2019-01-12 15:29:35,373 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2019-01-12 15:29:35,374 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2019-01-12 15:29:35,374 INFO L448 ceAbstractionStarter]: For program point L142(lines 142 147) no Hoare annotation was computed. [2019-01-12 15:29:35,374 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2019-01-12 15:29:35,374 INFO L448 ceAbstractionStarter]: For program point L142-2(lines 142 147) no Hoare annotation was computed. [2019-01-12 15:29:35,374 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 109 114) no Hoare annotation was computed. [2019-01-12 15:29:35,374 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-01-12 15:29:35,374 INFO L448 ceAbstractionStarter]: For program point L142-3(lines 142 147) no Hoare annotation was computed. [2019-01-12 15:29:35,374 INFO L448 ceAbstractionStarter]: For program point L142-5(lines 142 147) no Hoare annotation was computed. [2019-01-12 15:29:35,378 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))) [2019-01-12 15:29:35,378 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))) [2019-01-12 15:29:35,378 INFO L448 ceAbstractionStarter]: For program point L276(line 276) no Hoare annotation was computed. [2019-01-12 15:29:35,378 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2019-01-12 15:29:35,379 INFO L448 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2019-01-12 15:29:35,379 INFO L448 ceAbstractionStarter]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2019-01-12 15:29:35,379 INFO L448 ceAbstractionStarter]: For program point L344-3(lines 343 371) no Hoare annotation was computed. [2019-01-12 15:29:35,379 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))) [2019-01-12 15:29:35,379 INFO L448 ceAbstractionStarter]: For program point L311-4(lines 310 338) no Hoare annotation was computed. [2019-01-12 15:29:35,379 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-01-12 15:29:35,379 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2019-01-12 15:29:35,380 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2019-01-12 15:29:35,380 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)) [2019-01-12 15:29:35,380 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-01-12 15:29:35,380 INFO L448 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2019-01-12 15:29:35,380 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2019-01-12 15:29:35,380 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))) [2019-01-12 15:29:35,380 INFO L448 ceAbstractionStarter]: For program point L380-3(lines 380 384) no Hoare annotation was computed. [2019-01-12 15:29:35,381 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))) [2019-01-12 15:29:35,385 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)) [2019-01-12 15:29:35,385 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))) [2019-01-12 15:29:35,386 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))) [2019-01-12 15:29:35,386 INFO L448 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2019-01-12 15:29:35,386 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2019-01-12 15:29:35,386 INFO L448 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2019-01-12 15:29:35,386 INFO L448 ceAbstractionStarter]: For program point L349-3(lines 343 371) no Hoare annotation was computed. [2019-01-12 15:29:35,386 INFO L448 ceAbstractionStarter]: For program point L316-3(lines 310 338) no Hoare annotation was computed. [2019-01-12 15:29:35,386 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-01-12 15:29:35,386 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:29:35,386 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))) [2019-01-12 15:29:35,387 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))) [2019-01-12 15:29:35,387 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))) [2019-01-12 15:29:35,387 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))) [2019-01-12 15:29:35,387 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))) [2019-01-12 15:29:35,388 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 192) no Hoare annotation was computed. [2019-01-12 15:29:35,390 INFO L448 ceAbstractionStarter]: For program point L187-2(lines 187 192) no Hoare annotation was computed. [2019-01-12 15:29:35,390 INFO L448 ceAbstractionStarter]: For program point L187-3(lines 187 192) no Hoare annotation was computed. [2019-01-12 15:29:35,390 INFO L448 ceAbstractionStarter]: For program point L187-5(lines 187 192) no Hoare annotation was computed. [2019-01-12 15:29:35,390 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2019-01-12 15:29:35,390 INFO L448 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2019-01-12 15:29:35,390 INFO L448 ceAbstractionStarter]: For program point L354-3(lines 343 371) no Hoare annotation was computed. [2019-01-12 15:29:35,390 INFO L448 ceAbstractionStarter]: For program point L321-3(lines 310 338) no Hoare annotation was computed. [2019-01-12 15:29:35,390 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2019-01-12 15:29:35,391 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:29:35,391 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))) [2019-01-12 15:29:35,391 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))) [2019-01-12 15:29:35,391 INFO L448 ceAbstractionStarter]: For program point L157(lines 157 162) no Hoare annotation was computed. [2019-01-12 15:29:35,391 INFO L448 ceAbstractionStarter]: For program point L157-2(lines 157 162) no Hoare annotation was computed. [2019-01-12 15:29:35,392 INFO L448 ceAbstractionStarter]: For program point L157-3(lines 157 162) no Hoare annotation was computed. [2019-01-12 15:29:35,392 INFO L448 ceAbstractionStarter]: For program point L157-5(lines 157 162) no Hoare annotation was computed. [2019-01-12 15:29:35,392 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)) [2019-01-12 15:29:35,392 INFO L448 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2019-01-12 15:29:35,392 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2019-01-12 15:29:35,392 INFO L448 ceAbstractionStarter]: For program point L258-1(lines 258 263) no Hoare annotation was computed. [2019-01-12 15:29:35,392 INFO L448 ceAbstractionStarter]: For program point L127(lines 127 132) no Hoare annotation was computed. [2019-01-12 15:29:35,392 INFO L448 ceAbstractionStarter]: For program point L127-2(lines 127 132) no Hoare annotation was computed. [2019-01-12 15:29:35,392 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:29:35,392 INFO L448 ceAbstractionStarter]: For program point L127-3(lines 127 132) no Hoare annotation was computed. [2019-01-12 15:29:35,393 INFO L448 ceAbstractionStarter]: For program point L127-5(lines 127 132) no Hoare annotation was computed. [2019-01-12 15:29:35,396 INFO L451 ceAbstractionStarter]: At program point L491(lines 491 497) the Hoare annotation is: true [2019-01-12 15:29:35,396 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2019-01-12 15:29:35,396 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2019-01-12 15:29:35,396 INFO L448 ceAbstractionStarter]: For program point L359-3(lines 343 371) no Hoare annotation was computed. [2019-01-12 15:29:35,396 INFO L448 ceAbstractionStarter]: For program point L326-3(lines 310 338) no Hoare annotation was computed. [2019-01-12 15:29:35,396 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2019-01-12 15:29:35,396 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2019-01-12 15:29:35,396 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2019-01-12 15:29:35,397 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 97 117) no Hoare annotation was computed. [2019-01-12 15:29:35,397 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))) [2019-01-12 15:29:35,397 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))) [2019-01-12 15:29:35,397 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 15:29:35,397 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2019-01-12 15:29:35,398 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))) [2019-01-12 15:29:35,401 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))) [2019-01-12 15:29:35,401 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)) [2019-01-12 15:29:35,401 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))) [2019-01-12 15:29:35,402 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)) [2019-01-12 15:29:35,402 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))) [2019-01-12 15:29:35,402 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)) [2019-01-12 15:29:35,402 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2019-01-12 15:29:35,402 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 101 116) no Hoare annotation was computed. [2019-01-12 15:29:35,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:29:35 BoogieIcfgContainer [2019-01-12 15:29:35,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:29:35,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:29:35,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:29:35,517 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:29:35,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:29:02" (3/4) ... [2019-01-12 15:29:35,522 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:29:35,540 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 15:29:35,540 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:29:35,734 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:29:35,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:29:35,736 INFO L168 Benchmark]: Toolchain (without parser) took 34892.81 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 504.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -145.2 MB). Peak memory consumption was 359.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:29:35,737 INFO L168 Benchmark]: CDTParser took 0.18 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. [2019-01-12 15:29:35,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 15:29:35,738 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.15 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:29:35,738 INFO L168 Benchmark]: Boogie Preprocessor took 104.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -201.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:29:35,742 INFO L168 Benchmark]: RCFGBuilder took 1044.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:29:35,742 INFO L168 Benchmark]: TraceAbstraction took 33120.74 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.0 MB). Peak memory consumption was 589.9 MB. Max. memory is 11.5 GB. [2019-01-12 15:29:35,743 INFO L168 Benchmark]: Witness Printer took 219.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:29:35,747 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.18 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 318.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 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 80.15 ms. Allocated memory is still 1.0 GB. Free memory is still 931.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -201.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1044.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33120.74 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.0 MB). Peak memory consumption was 589.9 MB. Max. memory is 11.5 GB. * Witness Printer took 219.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 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.9s OverallTime, 28 OverallIterations, 2 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 20.4s 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.3s 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.6s AutomataMinimizationTime, 28 MinimizatonAttempts, 3126 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 366 NumberOfFragments, 5986 HoareAnnotationTreeSize, 33 FomulaSimplifications, 62607 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 33 FomulaSimplificationsInter, 32353 FormulaSimplificationTreeSizeReductionInter, 17.7s 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...