./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem17_label18_true-unreach-call.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/eca-rers2012/Problem17_label18_true-unreach-call.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 709affefef23ed36745d6b141c72063985c3a0fd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:49:38,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:49:38,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:49:38,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:49:38,620 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:49:38,621 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:49:38,622 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:49:38,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:49:38,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:49:38,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:49:38,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:49:38,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:49:38,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:49:38,631 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:49:38,632 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:49:38,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:49:38,634 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:49:38,636 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:49:38,638 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:49:38,642 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:49:38,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:49:38,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:49:38,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:49:38,654 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:49:38,654 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:49:38,655 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:49:38,656 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:49:38,657 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:49:38,661 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:49:38,662 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:49:38,662 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:49:38,663 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:49:38,663 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:49:38,663 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:49:38,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:49:38,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:49:38,668 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:49:38,693 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:49:38,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:49:38,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:49:38,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:49:38,695 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:49:38,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:49:38,696 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:49:38,696 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:49:38,697 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:49:38,697 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:49:38,697 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:49:38,697 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:49:38,697 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:49:38,697 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:49:38,698 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:49:38,699 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:49:38,699 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:49:38,699 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:49:38,699 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:49:38,699 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:49:38,699 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:49:38,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:49:38,700 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:49:38,700 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:49:38,700 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:49:38,700 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:49:38,700 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:49:38,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:49:38,704 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 -> 709affefef23ed36745d6b141c72063985c3a0fd [2019-01-12 04:49:38,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:49:38,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:49:38,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:49:38,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:49:38,775 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:49:38,776 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem17_label18_true-unreach-call.c [2019-01-12 04:49:38,835 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f25630544/2600be801a7e4620845febe61b0bfabf/FLAG956be420b [2019-01-12 04:49:39,441 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:49:39,441 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem17_label18_true-unreach-call.c [2019-01-12 04:49:39,468 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f25630544/2600be801a7e4620845febe61b0bfabf/FLAG956be420b [2019-01-12 04:49:39,610 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f25630544/2600be801a7e4620845febe61b0bfabf [2019-01-12 04:49:39,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:49:39,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:49:39,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:49:39,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:49:39,624 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:49:39,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:49:39" (1/1) ... [2019-01-12 04:49:39,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3222e414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:39, skipping insertion in model container [2019-01-12 04:49:39,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:49:39" (1/1) ... [2019-01-12 04:49:39,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:49:39,746 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:49:40,813 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:49:40,825 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:49:41,279 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:49:41,301 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:49:41,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41 WrapperNode [2019-01-12 04:49:41,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:49:41,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:49:41,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:49:41,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:49:41,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (1/1) ... [2019-01-12 04:49:41,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (1/1) ... [2019-01-12 04:49:41,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:49:41,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:49:41,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:49:41,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:49:41,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (1/1) ... [2019-01-12 04:49:41,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (1/1) ... [2019-01-12 04:49:41,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (1/1) ... [2019-01-12 04:49:41,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (1/1) ... [2019-01-12 04:49:41,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (1/1) ... [2019-01-12 04:49:41,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (1/1) ... [2019-01-12 04:49:42,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (1/1) ... [2019-01-12 04:49:42,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:49:42,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:49:42,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:49:42,050 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:49:42,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (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 04:49:42,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:49:42,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:49:50,516 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:49:50,516 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:49:50,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:49:50 BoogieIcfgContainer [2019-01-12 04:49:50,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:49:50,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:49:50,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:49:50,524 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:49:50,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:49:39" (1/3) ... [2019-01-12 04:49:50,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5feddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:49:50, skipping insertion in model container [2019-01-12 04:49:50,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:49:41" (2/3) ... [2019-01-12 04:49:50,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5feddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:49:50, skipping insertion in model container [2019-01-12 04:49:50,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:49:50" (3/3) ... [2019-01-12 04:49:50,531 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label18_true-unreach-call.c [2019-01-12 04:49:50,539 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:49:50,547 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:49:50,563 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:49:50,601 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:49:50,602 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:49:50,602 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:49:50,602 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:49:50,602 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:49:50,602 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:49:50,602 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:49:50,602 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:49:50,602 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:49:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-01-12 04:49:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-12 04:49:50,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:49:50,643 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] [2019-01-12 04:49:50,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:49:50,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:49:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2019-01-12 04:49:50,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:49:50,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:49:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:49:50,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:49:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:49:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:49:51,147 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 04:49:51,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:49:51,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:49:51,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:49:51,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:49:51,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:49:51,173 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-01-12 04:49:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:49:59,480 INFO L93 Difference]: Finished difference Result 2089 states and 3897 transitions. [2019-01-12 04:49:59,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:49:59,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-01-12 04:49:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:49:59,512 INFO L225 Difference]: With dead ends: 2089 [2019-01-12 04:49:59,512 INFO L226 Difference]: Without dead ends: 1419 [2019-01-12 04:49:59,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:49:59,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-01-12 04:49:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1412. [2019-01-12 04:49:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-01-12 04:49:59,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2069 transitions. [2019-01-12 04:49:59,657 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2069 transitions. Word has length 55 [2019-01-12 04:49:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:49:59,658 INFO L480 AbstractCegarLoop]: Abstraction has 1412 states and 2069 transitions. [2019-01-12 04:49:59,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:49:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2069 transitions. [2019-01-12 04:49:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-12 04:49:59,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:49:59,668 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:49:59,669 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:49:59,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:49:59,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1046772668, now seen corresponding path program 1 times [2019-01-12 04:49:59,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:49:59,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:49:59,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:49:59,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:49:59,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:49:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:50:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:50:00,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:50:00,258 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 04:50:00,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:50:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:50:00,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:50:01,187 WARN L181 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 26 [2019-01-12 04:50:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:50:01,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:50:01,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-12 04:50:01,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:50:01,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:50:01,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:50:01,693 INFO L87 Difference]: Start difference. First operand 1412 states and 2069 transitions. Second operand 8 states. [2019-01-12 04:50:08,003 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-12 04:50:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:50:22,971 INFO L93 Difference]: Finished difference Result 10106 states and 15851 transitions. [2019-01-12 04:50:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 04:50:22,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2019-01-12 04:50:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:50:23,001 INFO L225 Difference]: With dead ends: 10106 [2019-01-12 04:50:23,001 INFO L226 Difference]: Without dead ends: 5686 [2019-01-12 04:50:23,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-01-12 04:50:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2019-01-12 04:50:23,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 3127. [2019-01-12 04:50:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2019-01-12 04:50:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 4057 transitions. [2019-01-12 04:50:23,094 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 4057 transitions. Word has length 125 [2019-01-12 04:50:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:50:23,094 INFO L480 AbstractCegarLoop]: Abstraction has 3127 states and 4057 transitions. [2019-01-12 04:50:23,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:50:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 4057 transitions. [2019-01-12 04:50:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-01-12 04:50:23,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:50:23,101 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:50:23,102 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:50:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:50:23,102 INFO L82 PathProgramCache]: Analyzing trace with hash -983063388, now seen corresponding path program 1 times [2019-01-12 04:50:23,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:50:23,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:50:23,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:50:23,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:50:23,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:50:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:50:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:50:23,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:50:23,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:50:23,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:50:23,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:50:23,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:50:23,300 INFO L87 Difference]: Start difference. First operand 3127 states and 4057 transitions. Second operand 3 states. [2019-01-12 04:50:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:50:26,825 INFO L93 Difference]: Finished difference Result 7959 states and 10693 transitions. [2019-01-12 04:50:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:50:26,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-01-12 04:50:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:50:26,854 INFO L225 Difference]: With dead ends: 7959 [2019-01-12 04:50:26,856 INFO L226 Difference]: Without dead ends: 5259 [2019-01-12 04:50:26,861 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 04:50:26,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2019-01-12 04:50:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5259. [2019-01-12 04:50:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5259 states. [2019-01-12 04:50:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5259 states to 5259 states and 6628 transitions. [2019-01-12 04:50:26,972 INFO L78 Accepts]: Start accepts. Automaton has 5259 states and 6628 transitions. Word has length 203 [2019-01-12 04:50:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:50:26,974 INFO L480 AbstractCegarLoop]: Abstraction has 5259 states and 6628 transitions. [2019-01-12 04:50:26,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:50:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 6628 transitions. [2019-01-12 04:50:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-01-12 04:50:26,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:50:26,988 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:50:26,989 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:50:26,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:50:26,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1178526916, now seen corresponding path program 1 times [2019-01-12 04:50:26,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:50:26,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:50:26,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:50:26,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:50:26,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:50:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:50:27,571 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:50:27,750 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 285 proven. 82 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-12 04:50:27,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:50:27,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:50:27,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:50:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:50:27,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:50:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 285 proven. 82 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-12 04:50:28,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:50:28,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2019-01-12 04:50:28,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:50:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:50:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:50:28,102 INFO L87 Difference]: Start difference. First operand 5259 states and 6628 transitions. Second operand 7 states. [2019-01-12 04:50:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:50:37,686 INFO L93 Difference]: Finished difference Result 19909 states and 25276 transitions. [2019-01-12 04:50:37,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:50:37,686 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 369 [2019-01-12 04:50:37,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:50:37,740 INFO L225 Difference]: With dead ends: 19909 [2019-01-12 04:50:37,741 INFO L226 Difference]: Without dead ends: 14222 [2019-01-12 04:50:37,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:50:37,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14222 states. [2019-01-12 04:50:37,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14222 to 13781. [2019-01-12 04:50:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13781 states. [2019-01-12 04:50:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13781 states to 13781 states and 16554 transitions. [2019-01-12 04:50:38,027 INFO L78 Accepts]: Start accepts. Automaton has 13781 states and 16554 transitions. Word has length 369 [2019-01-12 04:50:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:50:38,027 INFO L480 AbstractCegarLoop]: Abstraction has 13781 states and 16554 transitions. [2019-01-12 04:50:38,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:50:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13781 states and 16554 transitions. [2019-01-12 04:50:38,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-01-12 04:50:38,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:50:38,040 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:50:38,040 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:50:38,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:50:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash -236055178, now seen corresponding path program 1 times [2019-01-12 04:50:38,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:50:38,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:50:38,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:50:38,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:50:38,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:50:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:50:38,874 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:50:39,039 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2019-01-12 04:50:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 158 proven. 269 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:50:39,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:50:39,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:50:39,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:50:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:50:39,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:50:39,832 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 20 [2019-01-12 04:50:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 292 proven. 82 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-12 04:50:40,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:50:40,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 7 [2019-01-12 04:50:40,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:50:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:50:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:50:40,342 INFO L87 Difference]: Start difference. First operand 13781 states and 16554 transitions. Second operand 8 states. [2019-01-12 04:50:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:50:52,809 INFO L93 Difference]: Finished difference Result 45028 states and 54456 transitions. [2019-01-12 04:50:52,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:50:52,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 376 [2019-01-12 04:50:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:50:52,877 INFO L225 Difference]: With dead ends: 45028 [2019-01-12 04:50:52,877 INFO L226 Difference]: Without dead ends: 31248 [2019-01-12 04:50:52,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:50:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31248 states. [2019-01-12 04:50:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31248 to 24413. [2019-01-12 04:50:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24413 states. [2019-01-12 04:50:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24413 states to 24413 states and 28707 transitions. [2019-01-12 04:50:53,478 INFO L78 Accepts]: Start accepts. Automaton has 24413 states and 28707 transitions. Word has length 376 [2019-01-12 04:50:53,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:50:53,478 INFO L480 AbstractCegarLoop]: Abstraction has 24413 states and 28707 transitions. [2019-01-12 04:50:53,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:50:53,479 INFO L276 IsEmpty]: Start isEmpty. Operand 24413 states and 28707 transitions. [2019-01-12 04:50:53,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-01-12 04:50:53,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:50:53,511 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:50:53,511 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:50:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:50:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash 769876607, now seen corresponding path program 1 times [2019-01-12 04:50:53,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:50:53,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:50:53,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:50:53,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:50:53,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:50:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:50:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2019-01-12 04:50:54,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:50:54,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:50:54,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:50:54,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:50:54,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:50:54,049 INFO L87 Difference]: Start difference. First operand 24413 states and 28707 transitions. Second operand 4 states. [2019-01-12 04:50:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:50:58,134 INFO L93 Difference]: Finished difference Result 57323 states and 67791 transitions. [2019-01-12 04:50:58,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:50:58,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 488 [2019-01-12 04:50:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:50:58,188 INFO L225 Difference]: With dead ends: 57323 [2019-01-12 04:50:58,188 INFO L226 Difference]: Without dead ends: 25659 [2019-01-12 04:50:58,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:50:58,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25659 states. [2019-01-12 04:50:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25659 to 23105. [2019-01-12 04:50:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23105 states. [2019-01-12 04:50:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23105 states to 23105 states and 25912 transitions. [2019-01-12 04:50:58,838 INFO L78 Accepts]: Start accepts. Automaton has 23105 states and 25912 transitions. Word has length 488 [2019-01-12 04:50:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:50:58,839 INFO L480 AbstractCegarLoop]: Abstraction has 23105 states and 25912 transitions. [2019-01-12 04:50:58,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:50:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 23105 states and 25912 transitions. [2019-01-12 04:50:58,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2019-01-12 04:50:58,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:50:58,860 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:50:58,860 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:50:58,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:50:58,860 INFO L82 PathProgramCache]: Analyzing trace with hash 72369002, now seen corresponding path program 1 times [2019-01-12 04:50:58,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:50:58,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:50:58,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:50:58,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:50:58,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:50:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:50:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-01-12 04:50:59,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:50:59,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:50:59,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:50:59,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:50:59,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:50:59,238 INFO L87 Difference]: Start difference. First operand 23105 states and 25912 transitions. Second operand 3 states. [2019-01-12 04:51:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:51:01,707 INFO L93 Difference]: Finished difference Result 52587 states and 58971 transitions. [2019-01-12 04:51:01,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:51:01,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 540 [2019-01-12 04:51:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:51:01,762 INFO L225 Difference]: With dead ends: 52587 [2019-01-12 04:51:01,762 INFO L226 Difference]: Without dead ends: 30334 [2019-01-12 04:51:01,783 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 04:51:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30334 states. [2019-01-12 04:51:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30334 to 29056. [2019-01-12 04:51:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29056 states. [2019-01-12 04:51:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29056 states to 29056 states and 32175 transitions. [2019-01-12 04:51:02,255 INFO L78 Accepts]: Start accepts. Automaton has 29056 states and 32175 transitions. Word has length 540 [2019-01-12 04:51:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:51:02,258 INFO L480 AbstractCegarLoop]: Abstraction has 29056 states and 32175 transitions. [2019-01-12 04:51:02,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:51:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 29056 states and 32175 transitions. [2019-01-12 04:51:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-01-12 04:51:02,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:51:02,300 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:51:02,301 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:51:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:51:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash -517612231, now seen corresponding path program 1 times [2019-01-12 04:51:02,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:51:02,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:51:02,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:02,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:51:02,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:51:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2019-01-12 04:51:03,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:51:03,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:51:03,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:51:03,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:51:03,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:51:03,125 INFO L87 Difference]: Start difference. First operand 29056 states and 32175 transitions. Second operand 3 states. [2019-01-12 04:51:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:51:07,155 INFO L93 Difference]: Finished difference Result 73425 states and 81091 transitions. [2019-01-12 04:51:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:51:07,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 580 [2019-01-12 04:51:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:51:07,201 INFO L225 Difference]: With dead ends: 73425 [2019-01-12 04:51:07,202 INFO L226 Difference]: Without dead ends: 44793 [2019-01-12 04:51:07,231 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 04:51:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44793 states. [2019-01-12 04:51:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44793 to 40952. [2019-01-12 04:51:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40952 states. [2019-01-12 04:51:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40952 states to 40952 states and 45126 transitions. [2019-01-12 04:51:07,688 INFO L78 Accepts]: Start accepts. Automaton has 40952 states and 45126 transitions. Word has length 580 [2019-01-12 04:51:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:51:07,689 INFO L480 AbstractCegarLoop]: Abstraction has 40952 states and 45126 transitions. [2019-01-12 04:51:07,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:51:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 40952 states and 45126 transitions. [2019-01-12 04:51:07,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2019-01-12 04:51:07,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:51:07,714 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:07,714 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:51:07,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:51:07,716 INFO L82 PathProgramCache]: Analyzing trace with hash -682726189, now seen corresponding path program 1 times [2019-01-12 04:51:07,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:51:07,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:51:07,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:07,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:51:07,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:51:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2019-01-12 04:51:08,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:51:08,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:51:08,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:51:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:51:08,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:51:08,696 INFO L87 Difference]: Start difference. First operand 40952 states and 45126 transitions. Second operand 3 states. [2019-01-12 04:51:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:51:11,048 INFO L93 Difference]: Finished difference Result 87859 states and 96737 transitions. [2019-01-12 04:51:11,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:51:11,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 620 [2019-01-12 04:51:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:51:11,098 INFO L225 Difference]: With dead ends: 87859 [2019-01-12 04:51:11,098 INFO L226 Difference]: Without dead ends: 47759 [2019-01-12 04:51:11,125 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 04:51:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47759 states. [2019-01-12 04:51:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47759 to 39669. [2019-01-12 04:51:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39669 states. [2019-01-12 04:51:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39669 states to 39669 states and 43687 transitions. [2019-01-12 04:51:11,600 INFO L78 Accepts]: Start accepts. Automaton has 39669 states and 43687 transitions. Word has length 620 [2019-01-12 04:51:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:51:11,601 INFO L480 AbstractCegarLoop]: Abstraction has 39669 states and 43687 transitions. [2019-01-12 04:51:11,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:51:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 39669 states and 43687 transitions. [2019-01-12 04:51:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2019-01-12 04:51:11,618 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:51:11,620 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:11,620 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:51:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:51:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1771694852, now seen corresponding path program 1 times [2019-01-12 04:51:11,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:51:11,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:51:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:11,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:51:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:51:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-01-12 04:51:12,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:51:12,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:51:12,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:51:12,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:51:12,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:51:12,524 INFO L87 Difference]: Start difference. First operand 39669 states and 43687 transitions. Second operand 4 states. [2019-01-12 04:51:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:51:15,927 INFO L93 Difference]: Finished difference Result 78055 states and 86055 transitions. [2019-01-12 04:51:15,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:51:15,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 639 [2019-01-12 04:51:15,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:51:15,962 INFO L225 Difference]: With dead ends: 78055 [2019-01-12 04:51:15,962 INFO L226 Difference]: Without dead ends: 39238 [2019-01-12 04:51:15,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:51:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39238 states. [2019-01-12 04:51:16,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39238 to 38386. [2019-01-12 04:51:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38386 states. [2019-01-12 04:51:16,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38386 states to 38386 states and 41420 transitions. [2019-01-12 04:51:16,308 INFO L78 Accepts]: Start accepts. Automaton has 38386 states and 41420 transitions. Word has length 639 [2019-01-12 04:51:16,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:51:16,309 INFO L480 AbstractCegarLoop]: Abstraction has 38386 states and 41420 transitions. [2019-01-12 04:51:16,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:51:16,309 INFO L276 IsEmpty]: Start isEmpty. Operand 38386 states and 41420 transitions. [2019-01-12 04:51:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2019-01-12 04:51:16,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:51:16,324 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:51:16,325 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:51:16,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:51:16,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1109461694, now seen corresponding path program 1 times [2019-01-12 04:51:16,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:51:16,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:51:16,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:16,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:51:16,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:51:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 703 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2019-01-12 04:51:17,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:51:17,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:51:17,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:51:17,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:51:17,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:51:17,327 INFO L87 Difference]: Start difference. First operand 38386 states and 41420 transitions. Second operand 5 states. [2019-01-12 04:51:23,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:51:23,521 INFO L93 Difference]: Finished difference Result 85735 states and 93110 transitions. [2019-01-12 04:51:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:51:23,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 678 [2019-01-12 04:51:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:51:23,583 INFO L225 Difference]: With dead ends: 85735 [2019-01-12 04:51:23,584 INFO L226 Difference]: Without dead ends: 51607 [2019-01-12 04:51:23,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:51:23,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51607 states. [2019-01-12 04:51:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51607 to 44374. [2019-01-12 04:51:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44374 states. [2019-01-12 04:51:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44374 states to 44374 states and 47983 transitions. [2019-01-12 04:51:24,021 INFO L78 Accepts]: Start accepts. Automaton has 44374 states and 47983 transitions. Word has length 678 [2019-01-12 04:51:24,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:51:24,022 INFO L480 AbstractCegarLoop]: Abstraction has 44374 states and 47983 transitions. [2019-01-12 04:51:24,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:51:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 44374 states and 47983 transitions. [2019-01-12 04:51:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2019-01-12 04:51:24,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:51:24,039 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:24,039 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:51:24,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:51:24,040 INFO L82 PathProgramCache]: Analyzing trace with hash 736192065, now seen corresponding path program 1 times [2019-01-12 04:51:24,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:51:24,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:51:24,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:24,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:51:24,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:51:24,815 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-12 04:51:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 211 proven. 405 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-01-12 04:51:25,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:51:25,990 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:51:26,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:51:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:51:26,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:51:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 536 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-12 04:51:27,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:51:27,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-01-12 04:51:27,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:51:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:51:27,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:51:27,126 INFO L87 Difference]: Start difference. First operand 44374 states and 47983 transitions. Second operand 8 states. [2019-01-12 04:51:38,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:51:38,617 INFO L93 Difference]: Finished difference Result 90456 states and 98081 transitions. [2019-01-12 04:51:38,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 04:51:38,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 703 [2019-01-12 04:51:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:51:38,664 INFO L225 Difference]: With dead ends: 90456 [2019-01-12 04:51:38,664 INFO L226 Difference]: Without dead ends: 51187 [2019-01-12 04:51:38,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 701 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:51:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51187 states. [2019-01-12 04:51:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51187 to 45217. [2019-01-12 04:51:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45217 states. [2019-01-12 04:51:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45217 states to 45217 states and 48628 transitions. [2019-01-12 04:51:39,074 INFO L78 Accepts]: Start accepts. Automaton has 45217 states and 48628 transitions. Word has length 703 [2019-01-12 04:51:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:51:39,074 INFO L480 AbstractCegarLoop]: Abstraction has 45217 states and 48628 transitions. [2019-01-12 04:51:39,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:51:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 45217 states and 48628 transitions. [2019-01-12 04:51:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 721 [2019-01-12 04:51:39,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:51:39,091 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:51:39,091 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:51:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:51:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash 728337234, now seen corresponding path program 1 times [2019-01-12 04:51:39,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:51:39,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:51:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:39,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:51:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:51:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:51:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 345 proven. 672 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-01-12 04:51:40,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:51:40,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:51:40,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:51:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:51:40,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:51:40,977 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2019-01-12 04:51:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-01-12 04:51:42,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:51:42,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-01-12 04:51:42,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:51:42,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:51:42,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:51:42,156 INFO L87 Difference]: Start difference. First operand 45217 states and 48628 transitions. Second operand 9 states. [2019-01-12 04:52:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:52:29,112 INFO L93 Difference]: Finished difference Result 94266 states and 101358 transitions. [2019-01-12 04:52:29,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:52:29,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 720 [2019-01-12 04:52:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:52:29,162 INFO L225 Difference]: With dead ends: 94266 [2019-01-12 04:52:29,162 INFO L226 Difference]: Without dead ends: 54582 [2019-01-12 04:52:29,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 718 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:52:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54582 states. [2019-01-12 04:52:29,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54582 to 48193. [2019-01-12 04:52:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48193 states. [2019-01-12 04:52:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48193 states to 48193 states and 51672 transitions. [2019-01-12 04:52:29,611 INFO L78 Accepts]: Start accepts. Automaton has 48193 states and 51672 transitions. Word has length 720 [2019-01-12 04:52:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:52:29,612 INFO L480 AbstractCegarLoop]: Abstraction has 48193 states and 51672 transitions. [2019-01-12 04:52:29,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:52:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 48193 states and 51672 transitions. [2019-01-12 04:52:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2019-01-12 04:52:29,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:52:29,627 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:52:29,628 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:52:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:52:29,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1029628016, now seen corresponding path program 1 times [2019-01-12 04:52:29,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:52:29,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:52:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:29,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:52:29,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:52:30,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 768 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2019-01-12 04:52:30,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:52:30,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:52:30,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:52:30,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:52:30,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:52:30,680 INFO L87 Difference]: Start difference. First operand 48193 states and 51672 transitions. Second operand 3 states. [2019-01-12 04:52:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:52:33,918 INFO L93 Difference]: Finished difference Result 100636 states and 107938 transitions. [2019-01-12 04:52:33,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:52:33,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 761 [2019-01-12 04:52:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:52:33,979 INFO L225 Difference]: With dead ends: 100636 [2019-01-12 04:52:33,979 INFO L226 Difference]: Without dead ends: 52868 [2019-01-12 04:52:34,004 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 04:52:34,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52868 states. [2019-01-12 04:52:34,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52868 to 48613. [2019-01-12 04:52:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48613 states. [2019-01-12 04:52:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48613 states to 48613 states and 51601 transitions. [2019-01-12 04:52:34,780 INFO L78 Accepts]: Start accepts. Automaton has 48613 states and 51601 transitions. Word has length 761 [2019-01-12 04:52:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:52:34,781 INFO L480 AbstractCegarLoop]: Abstraction has 48613 states and 51601 transitions. [2019-01-12 04:52:34,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:52:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 48613 states and 51601 transitions. [2019-01-12 04:52:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2019-01-12 04:52:34,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:52:34,803 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:52:34,803 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:52:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:52:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1453937331, now seen corresponding path program 1 times [2019-01-12 04:52:34,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:52:34,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:52:34,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:34,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:52:34,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:52:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 1253 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-01-12 04:52:36,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:52:36,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:52:36,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:52:36,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:52:36,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:52:36,063 INFO L87 Difference]: Start difference. First operand 48613 states and 51601 transitions. Second operand 5 states. [2019-01-12 04:52:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:52:42,407 INFO L93 Difference]: Finished difference Result 107026 states and 113637 transitions. [2019-01-12 04:52:42,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:52:42,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 818 [2019-01-12 04:52:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:52:42,461 INFO L225 Difference]: With dead ends: 107026 [2019-01-12 04:52:42,461 INFO L226 Difference]: Without dead ends: 63521 [2019-01-12 04:52:42,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:52:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63521 states. [2019-01-12 04:52:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63521 to 48632. [2019-01-12 04:52:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48632 states. [2019-01-12 04:52:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48632 states to 48632 states and 51685 transitions. [2019-01-12 04:52:42,940 INFO L78 Accepts]: Start accepts. Automaton has 48632 states and 51685 transitions. Word has length 818 [2019-01-12 04:52:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:52:42,941 INFO L480 AbstractCegarLoop]: Abstraction has 48632 states and 51685 transitions. [2019-01-12 04:52:42,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:52:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 48632 states and 51685 transitions. [2019-01-12 04:52:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2019-01-12 04:52:42,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:52:42,964 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:52:42,964 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:52:42,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:52:42,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1111320654, now seen corresponding path program 1 times [2019-01-12 04:52:42,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:52:42,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:52:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:42,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:52:42,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:52:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 1096 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-01-12 04:52:44,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:52:44,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:52:44,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:52:44,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:52:44,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:52:44,353 INFO L87 Difference]: Start difference. First operand 48632 states and 51685 transitions. Second operand 5 states. [2019-01-12 04:52:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:52:50,122 INFO L93 Difference]: Finished difference Result 104503 states and 110947 transitions. [2019-01-12 04:52:50,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:52:50,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 828 [2019-01-12 04:52:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:52:50,175 INFO L225 Difference]: With dead ends: 104503 [2019-01-12 04:52:50,175 INFO L226 Difference]: Without dead ends: 60552 [2019-01-12 04:52:50,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:52:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60552 states. [2019-01-12 04:52:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60552 to 47782. [2019-01-12 04:52:50,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47782 states. [2019-01-12 04:52:50,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47782 states to 47782 states and 50784 transitions. [2019-01-12 04:52:50,632 INFO L78 Accepts]: Start accepts. Automaton has 47782 states and 50784 transitions. Word has length 828 [2019-01-12 04:52:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:52:50,633 INFO L480 AbstractCegarLoop]: Abstraction has 47782 states and 50784 transitions. [2019-01-12 04:52:50,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:52:50,633 INFO L276 IsEmpty]: Start isEmpty. Operand 47782 states and 50784 transitions. [2019-01-12 04:52:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2019-01-12 04:52:50,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:52:50,650 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:52:50,652 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:52:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:52:50,652 INFO L82 PathProgramCache]: Analyzing trace with hash 211187487, now seen corresponding path program 1 times [2019-01-12 04:52:50,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:52:50,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:52:50,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:50,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:52:50,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:52:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 1003 proven. 0 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2019-01-12 04:52:51,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:52:51,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 04:52:51,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:52:51,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:52:51,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:52:51,236 INFO L87 Difference]: Start difference. First operand 47782 states and 50784 transitions. Second operand 3 states. [2019-01-12 04:52:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:52:52,833 INFO L93 Difference]: Finished difference Result 90028 states and 95782 transitions. [2019-01-12 04:52:52,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:52:52,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 841 [2019-01-12 04:52:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:52:52,875 INFO L225 Difference]: With dead ends: 90028 [2019-01-12 04:52:52,875 INFO L226 Difference]: Without dead ends: 45650 [2019-01-12 04:52:52,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:52:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45650 states. [2019-01-12 04:52:53,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45650 to 45223. [2019-01-12 04:52:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45223 states. [2019-01-12 04:52:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45223 states to 45223 states and 48041 transitions. [2019-01-12 04:52:53,673 INFO L78 Accepts]: Start accepts. Automaton has 45223 states and 48041 transitions. Word has length 841 [2019-01-12 04:52:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:52:53,673 INFO L480 AbstractCegarLoop]: Abstraction has 45223 states and 48041 transitions. [2019-01-12 04:52:53,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:52:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 45223 states and 48041 transitions. [2019-01-12 04:52:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2019-01-12 04:52:53,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:52:53,691 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:52:53,691 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:52:53,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:52:53,692 INFO L82 PathProgramCache]: Analyzing trace with hash 32043245, now seen corresponding path program 1 times [2019-01-12 04:52:53,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:52:53,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:52:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:53,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:52:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:52:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-01-12 04:52:54,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:52:54,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:52:54,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:52:54,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:52:54,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:52:54,254 INFO L87 Difference]: Start difference. First operand 45223 states and 48041 transitions. Second operand 3 states. [2019-01-12 04:52:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:52:56,481 INFO L93 Difference]: Finished difference Result 87893 states and 93482 transitions. [2019-01-12 04:52:56,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:52:56,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 883 [2019-01-12 04:52:56,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:52:56,519 INFO L225 Difference]: With dead ends: 87893 [2019-01-12 04:52:56,519 INFO L226 Difference]: Without dead ends: 46074 [2019-01-12 04:52:56,539 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 04:52:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46074 states. [2019-01-12 04:52:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46074 to 45648. [2019-01-12 04:52:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45648 states. [2019-01-12 04:52:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45648 states to 45648 states and 48435 transitions. [2019-01-12 04:52:56,939 INFO L78 Accepts]: Start accepts. Automaton has 45648 states and 48435 transitions. Word has length 883 [2019-01-12 04:52:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:52:56,940 INFO L480 AbstractCegarLoop]: Abstraction has 45648 states and 48435 transitions. [2019-01-12 04:52:56,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:52:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 45648 states and 48435 transitions. [2019-01-12 04:52:56,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2019-01-12 04:52:56,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:52:56,962 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:52:56,963 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:52:56,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:52:56,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1969069858, now seen corresponding path program 1 times [2019-01-12 04:52:56,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:52:56,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:52:56,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:56,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:52:56,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:52:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:52:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 1423 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2019-01-12 04:52:57,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:52:57,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:52:57,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:52:57,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:52:57,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:52:57,672 INFO L87 Difference]: Start difference. First operand 45648 states and 48435 transitions. Second operand 5 states. [2019-01-12 04:53:03,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:53:03,216 INFO L93 Difference]: Finished difference Result 108766 states and 115722 transitions. [2019-01-12 04:53:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:53:03,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 903 [2019-01-12 04:53:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:53:03,277 INFO L225 Difference]: With dead ends: 108766 [2019-01-12 04:53:03,277 INFO L226 Difference]: Without dead ends: 66097 [2019-01-12 04:53:03,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:53:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66097 states. [2019-01-12 04:53:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66097 to 55458. [2019-01-12 04:53:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55458 states. [2019-01-12 04:53:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55458 states to 55458 states and 58886 transitions. [2019-01-12 04:53:03,829 INFO L78 Accepts]: Start accepts. Automaton has 55458 states and 58886 transitions. Word has length 903 [2019-01-12 04:53:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:53:03,830 INFO L480 AbstractCegarLoop]: Abstraction has 55458 states and 58886 transitions. [2019-01-12 04:53:03,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:53:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 55458 states and 58886 transitions. [2019-01-12 04:53:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2019-01-12 04:53:03,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:53:03,853 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:53:03,853 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:53:03,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:53:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash 337102246, now seen corresponding path program 1 times [2019-01-12 04:53:03,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:53:03,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:53:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:53:03,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:53:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:53:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:53:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 968 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-12 04:53:04,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:53:04,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:53:04,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:53:04,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:53:04,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:53:04,650 INFO L87 Difference]: Start difference. First operand 55458 states and 58886 transitions. Second operand 4 states. [2019-01-12 04:53:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:53:08,703 INFO L93 Difference]: Finished difference Result 119864 states and 127071 transitions. [2019-01-12 04:53:08,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:53:08,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 908 [2019-01-12 04:53:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:53:08,759 INFO L225 Difference]: With dead ends: 119864 [2019-01-12 04:53:08,760 INFO L226 Difference]: Without dead ends: 67385 [2019-01-12 04:53:08,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:53:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67385 states. [2019-01-12 04:53:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67385 to 57160. [2019-01-12 04:53:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57160 states. [2019-01-12 04:53:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57160 states to 57160 states and 60696 transitions. [2019-01-12 04:53:09,310 INFO L78 Accepts]: Start accepts. Automaton has 57160 states and 60696 transitions. Word has length 908 [2019-01-12 04:53:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:53:09,311 INFO L480 AbstractCegarLoop]: Abstraction has 57160 states and 60696 transitions. [2019-01-12 04:53:09,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:53:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 57160 states and 60696 transitions. [2019-01-12 04:53:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2019-01-12 04:53:09,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:53:09,330 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:53:09,330 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:53:09,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:53:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1834210275, now seen corresponding path program 1 times [2019-01-12 04:53:09,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:53:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:53:09,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:53:09,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:53:09,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:53:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:53:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1684 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2019-01-12 04:53:10,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:53:10,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:53:10,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:53:10,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:53:10,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:53:10,458 INFO L87 Difference]: Start difference. First operand 57160 states and 60696 transitions. Second operand 5 states. [2019-01-12 04:53:16,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:53:16,360 INFO L93 Difference]: Finished difference Result 120284 states and 127640 transitions. [2019-01-12 04:53:16,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:53:16,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 913 [2019-01-12 04:53:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:53:16,418 INFO L225 Difference]: With dead ends: 120284 [2019-01-12 04:53:16,418 INFO L226 Difference]: Without dead ends: 66528 [2019-01-12 04:53:16,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:53:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66528 states. [2019-01-12 04:53:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66528 to 52039. [2019-01-12 04:53:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52039 states. [2019-01-12 04:53:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52039 states to 52039 states and 55206 transitions. [2019-01-12 04:53:16,952 INFO L78 Accepts]: Start accepts. Automaton has 52039 states and 55206 transitions. Word has length 913 [2019-01-12 04:53:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:53:16,953 INFO L480 AbstractCegarLoop]: Abstraction has 52039 states and 55206 transitions. [2019-01-12 04:53:16,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:53:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 52039 states and 55206 transitions. [2019-01-12 04:53:16,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2019-01-12 04:53:16,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:53:16,971 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:53:16,972 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:53:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:53:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash -479682453, now seen corresponding path program 1 times [2019-01-12 04:53:16,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:53:16,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:53:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:53:16,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:53:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:53:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:53:17,680 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-12 04:53:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 669 proven. 470 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-01-12 04:53:19,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:53:19,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:53:19,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:53:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:53:19,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:53:19,746 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 25 [2019-01-12 04:53:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-01-12 04:53:21,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:53:21,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:53:21,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:53:21,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:53:21,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:53:21,702 INFO L87 Difference]: Start difference. First operand 52039 states and 55206 transitions. Second operand 8 states. [2019-01-12 04:53:49,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:53:49,501 INFO L93 Difference]: Finished difference Result 124093 states and 131652 transitions. [2019-01-12 04:53:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 04:53:49,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 918 [2019-01-12 04:53:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:53:49,568 INFO L225 Difference]: With dead ends: 124093 [2019-01-12 04:53:49,568 INFO L226 Difference]: Without dead ends: 72905 [2019-01-12 04:53:49,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 926 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-01-12 04:53:49,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72905 states. [2019-01-12 04:53:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72905 to 63092. [2019-01-12 04:53:50,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63092 states. [2019-01-12 04:53:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63092 states to 63092 states and 66500 transitions. [2019-01-12 04:53:50,184 INFO L78 Accepts]: Start accepts. Automaton has 63092 states and 66500 transitions. Word has length 918 [2019-01-12 04:53:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:53:50,184 INFO L480 AbstractCegarLoop]: Abstraction has 63092 states and 66500 transitions. [2019-01-12 04:53:50,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:53:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 63092 states and 66500 transitions. [2019-01-12 04:53:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2019-01-12 04:53:50,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:53:50,209 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:53:50,210 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:53:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:53:50,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1814922569, now seen corresponding path program 1 times [2019-01-12 04:53:50,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:53:50,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:53:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:53:50,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:53:50,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:53:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:53:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 1271 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-01-12 04:53:51,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:53:51,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:53:51,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:53:51,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:53:51,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:53:51,022 INFO L87 Difference]: Start difference. First operand 63092 states and 66500 transitions. Second operand 5 states. [2019-01-12 04:53:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:53:56,147 INFO L93 Difference]: Finished difference Result 147481 states and 155963 transitions. [2019-01-12 04:53:56,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:53:56,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1005 [2019-01-12 04:53:56,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:53:56,224 INFO L225 Difference]: With dead ends: 147481 [2019-01-12 04:53:56,225 INFO L226 Difference]: Without dead ends: 87797 [2019-01-12 04:53:56,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:53:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87797 states. [2019-01-12 04:53:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87797 to 60956. [2019-01-12 04:53:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60956 states. [2019-01-12 04:53:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60956 states to 60956 states and 64324 transitions. [2019-01-12 04:53:57,357 INFO L78 Accepts]: Start accepts. Automaton has 60956 states and 64324 transitions. Word has length 1005 [2019-01-12 04:53:57,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:53:57,358 INFO L480 AbstractCegarLoop]: Abstraction has 60956 states and 64324 transitions. [2019-01-12 04:53:57,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:53:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand 60956 states and 64324 transitions. [2019-01-12 04:53:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1102 [2019-01-12 04:53:57,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:53:57,384 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:53:57,384 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:53:57,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:53:57,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1759486490, now seen corresponding path program 1 times [2019-01-12 04:53:57,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:53:57,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:53:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:53:57,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:53:57,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:53:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:53:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 1487 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2019-01-12 04:53:58,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:53:58,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:53:58,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:53:58,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:53:58,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:53:58,303 INFO L87 Difference]: Start difference. First operand 60956 states and 64324 transitions. Second operand 5 states. [2019-01-12 04:54:03,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:54:03,866 INFO L93 Difference]: Finished difference Result 132981 states and 140437 transitions. [2019-01-12 04:54:03,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:54:03,867 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1101 [2019-01-12 04:54:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:54:03,930 INFO L225 Difference]: With dead ends: 132981 [2019-01-12 04:54:03,930 INFO L226 Difference]: Without dead ends: 75433 [2019-01-12 04:54:03,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:54:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75433 states. [2019-01-12 04:54:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75433 to 56269. [2019-01-12 04:54:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56269 states. [2019-01-12 04:54:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56269 states to 56269 states and 59422 transitions. [2019-01-12 04:54:04,547 INFO L78 Accepts]: Start accepts. Automaton has 56269 states and 59422 transitions. Word has length 1101 [2019-01-12 04:54:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:54:04,548 INFO L480 AbstractCegarLoop]: Abstraction has 56269 states and 59422 transitions. [2019-01-12 04:54:04,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:54:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 56269 states and 59422 transitions. [2019-01-12 04:54:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1153 [2019-01-12 04:54:04,572 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:54:04,572 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:54:04,573 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:54:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:54:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1782584157, now seen corresponding path program 1 times [2019-01-12 04:54:04,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:54:04,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:54:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:54:04,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:54:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:54:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:54:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1516 backedges. 1013 proven. 245 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-01-12 04:54:06,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:54:06,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 04:54:06,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:54:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:54:06,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:54:09,268 WARN L181 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 395 DAG size of output: 51 [2019-01-12 04:54:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1516 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2019-01-12 04:54:12,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:54:12,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:54:12,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:54:12,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:54:12,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:54:12,881 INFO L87 Difference]: Start difference. First operand 56269 states and 59422 transitions. Second operand 8 states. [2019-01-12 04:54:30,111 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2019-01-12 04:56:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:56:59,710 INFO L93 Difference]: Finished difference Result 135937 states and 143342 transitions. [2019-01-12 04:56:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:56:59,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1152 [2019-01-12 04:56:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:56:59,783 INFO L225 Difference]: With dead ends: 135937 [2019-01-12 04:56:59,783 INFO L226 Difference]: Without dead ends: 80520 [2019-01-12 04:56:59,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1159 GetRequests, 1152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:56:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80520 states. [2019-01-12 04:57:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80520 to 63468. [2019-01-12 04:57:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63468 states. [2019-01-12 04:57:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63468 states to 63468 states and 66395 transitions. [2019-01-12 04:57:00,741 INFO L78 Accepts]: Start accepts. Automaton has 63468 states and 66395 transitions. Word has length 1152 [2019-01-12 04:57:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:57:00,742 INFO L480 AbstractCegarLoop]: Abstraction has 63468 states and 66395 transitions. [2019-01-12 04:57:00,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:57:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 63468 states and 66395 transitions. [2019-01-12 04:57:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1801 [2019-01-12 04:57:00,780 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:57:00,781 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:57:00,782 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:57:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:57:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash 833251247, now seen corresponding path program 1 times [2019-01-12 04:57:00,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:57:00,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:57:00,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:57:00,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:57:00,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:57:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:57:01,641 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-12 04:57:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4668 backedges. 2255 proven. 0 refuted. 0 times theorem prover too weak. 2413 trivial. 0 not checked. [2019-01-12 04:57:03,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:57:03,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:57:03,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:57:03,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:57:03,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:57:03,611 INFO L87 Difference]: Start difference. First operand 63468 states and 66395 transitions. Second operand 4 states. [2019-01-12 04:57:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:57:08,193 INFO L93 Difference]: Finished difference Result 121811 states and 127044 transitions. [2019-01-12 04:57:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:57:08,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1800 [2019-01-12 04:57:08,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:57:08,248 INFO L225 Difference]: With dead ends: 121811 [2019-01-12 04:57:08,248 INFO L226 Difference]: Without dead ends: 59195 [2019-01-12 04:57:08,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:57:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59195 states. [2019-01-12 04:57:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59195 to 52804. [2019-01-12 04:57:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52804 states. [2019-01-12 04:57:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52804 states to 52804 states and 54807 transitions. [2019-01-12 04:57:08,842 INFO L78 Accepts]: Start accepts. Automaton has 52804 states and 54807 transitions. Word has length 1800 [2019-01-12 04:57:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:57:08,844 INFO L480 AbstractCegarLoop]: Abstraction has 52804 states and 54807 transitions. [2019-01-12 04:57:08,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:57:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 52804 states and 54807 transitions. [2019-01-12 04:57:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1987 [2019-01-12 04:57:08,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:57:08,889 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:57:08,889 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:57:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:57:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1972589125, now seen corresponding path program 1 times [2019-01-12 04:57:08,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:57:08,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:57:08,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:57:08,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:57:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:57:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:57:10,014 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-12 04:57:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5896 backedges. 3349 proven. 0 refuted. 0 times theorem prover too weak. 2547 trivial. 0 not checked. [2019-01-12 04:57:12,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:57:12,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:57:12,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:57:12,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:57:12,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:57:12,088 INFO L87 Difference]: Start difference. First operand 52804 states and 54807 transitions. Second operand 5 states. [2019-01-12 04:57:17,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:57:17,120 INFO L93 Difference]: Finished difference Result 104751 states and 108657 transitions. [2019-01-12 04:57:17,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:57:17,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1986 [2019-01-12 04:57:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:57:17,169 INFO L225 Difference]: With dead ends: 104751 [2019-01-12 04:57:17,169 INFO L226 Difference]: Without dead ends: 54501 [2019-01-12 04:57:17,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:57:17,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54501 states. [2019-01-12 04:57:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54501 to 51523. [2019-01-12 04:57:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51523 states. [2019-01-12 04:57:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51523 states to 51523 states and 53342 transitions. [2019-01-12 04:57:17,719 INFO L78 Accepts]: Start accepts. Automaton has 51523 states and 53342 transitions. Word has length 1986 [2019-01-12 04:57:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:57:17,720 INFO L480 AbstractCegarLoop]: Abstraction has 51523 states and 53342 transitions. [2019-01-12 04:57:17,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:57:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 51523 states and 53342 transitions. [2019-01-12 04:57:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2288 [2019-01-12 04:57:17,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:57:17,768 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 04:57:17,768 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:57:17,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:57:17,769 INFO L82 PathProgramCache]: Analyzing trace with hash -190837525, now seen corresponding path program 1 times [2019-01-12 04:57:17,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:57:17,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:57:17,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:57:17,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:57:17,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:57:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:57:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7517 backedges. 5804 proven. 0 refuted. 0 times theorem prover too weak. 1713 trivial. 0 not checked. [2019-01-12 04:57:21,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:57:21,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:57:21,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:57:21,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:57:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:57:21,778 INFO L87 Difference]: Start difference. First operand 51523 states and 53342 transitions. Second operand 5 states. [2019-01-12 04:57:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:57:26,688 INFO L93 Difference]: Finished difference Result 106016 states and 109918 transitions. [2019-01-12 04:57:26,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:57:26,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2287 [2019-01-12 04:57:26,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:57:26,691 INFO L225 Difference]: With dead ends: 106016 [2019-01-12 04:57:26,691 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:57:26,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:57:26,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:57:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:57:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:57:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:57:26,720 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2287 [2019-01-12 04:57:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:57:26,720 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:57:26,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:57:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:57:26,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:57:26,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:57:26,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:26,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:26,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:26,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:26,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:26,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:26,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,141 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:27,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:28,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:28,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:28,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:28,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:28,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,483 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,484 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:29,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:30,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:30,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:30,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:30,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:30,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:30,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:30,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,039 WARN L181 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 1376 DAG size of output: 1055 [2019-01-12 04:57:31,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:31,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:32,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:32,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:32,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:32,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:32,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:32,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:32,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:32,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:32,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,337 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,558 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:33,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,440 WARN L181 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 1376 DAG size of output: 1055 [2019-01-12 04:57:34,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:34,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:35,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:35,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:35,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:35,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:35,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,576 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:36,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:37,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:37,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:37,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:37,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:37,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:37,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:57:37,943 WARN L181 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 1376 DAG size of output: 1055 [2019-01-12 04:57:53,626 WARN L181 SmtUtils]: Spent 15.67 s on a formula simplification. DAG size of input: 999 DAG size of output: 173 [2019-01-12 04:58:08,282 WARN L181 SmtUtils]: Spent 14.65 s on a formula simplification. DAG size of input: 999 DAG size of output: 173 [2019-01-12 04:58:22,154 WARN L181 SmtUtils]: Spent 13.86 s on a formula simplification. DAG size of input: 999 DAG size of output: 173 [2019-01-12 04:58:22,159 INFO L448 ceAbstractionStarter]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2019-01-12 04:58:22,159 INFO L448 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-01-12 04:58:22,159 INFO L448 ceAbstractionStarter]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2019-01-12 04:58:22,159 INFO L448 ceAbstractionStarter]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2019-01-12 04:58:22,160 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,161 INFO L448 ceAbstractionStarter]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,161 INFO L448 ceAbstractionStarter]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,161 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,161 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,161 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,161 INFO L448 ceAbstractionStarter]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,161 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 377) no Hoare annotation was computed. [2019-01-12 04:58:22,161 INFO L448 ceAbstractionStarter]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2019-01-12 04:58:22,161 INFO L448 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-01-12 04:58:22,161 INFO L448 ceAbstractionStarter]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,162 INFO L448 ceAbstractionStarter]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,163 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,163 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,163 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,163 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,163 INFO L448 ceAbstractionStarter]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,163 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,163 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,163 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 908) no Hoare annotation was computed. [2019-01-12 04:58:22,163 INFO L448 ceAbstractionStarter]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2019-01-12 04:58:22,163 INFO L448 ceAbstractionStarter]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,164 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L113(line 113) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,165 INFO L448 ceAbstractionStarter]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-01-12 04:58:22,166 INFO L448 ceAbstractionStarter]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,167 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,167 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,173 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,174 INFO L448 ceAbstractionStarter]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2019-01-12 04:58:22,175 INFO L448 ceAbstractionStarter]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,176 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 531) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L920(lines 920 929) no Hoare annotation was computed. [2019-01-12 04:58:22,177 INFO L448 ceAbstractionStarter]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,178 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,179 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,180 INFO L448 ceAbstractionStarter]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,181 INFO L448 ceAbstractionStarter]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,182 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 415) no Hoare annotation was computed. [2019-01-12 04:58:22,183 INFO L448 ceAbstractionStarter]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2019-01-12 04:58:22,185 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 286) no Hoare annotation was computed. [2019-01-12 04:58:22,185 INFO L448 ceAbstractionStarter]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,185 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2019-01-12 04:58:22,185 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,186 INFO L448 ceAbstractionStarter]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,187 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 557) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2019-01-12 04:58:22,188 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,189 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2019-01-12 04:58:22,190 INFO L448 ceAbstractionStarter]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2019-01-12 04:58:22,191 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-01-12 04:58:22,191 INFO L448 ceAbstractionStarter]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,197 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2019-01-12 04:58:22,197 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 697) no Hoare annotation was computed. [2019-01-12 04:58:22,197 INFO L448 ceAbstractionStarter]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2019-01-12 04:58:22,197 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,197 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,197 INFO L448 ceAbstractionStarter]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,197 INFO L448 ceAbstractionStarter]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,197 INFO L448 ceAbstractionStarter]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,197 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,198 INFO L448 ceAbstractionStarter]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,199 INFO L448 ceAbstractionStarter]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,204 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,204 INFO L448 ceAbstractionStarter]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,204 INFO L448 ceAbstractionStarter]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,204 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,204 INFO L448 ceAbstractionStarter]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,204 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,204 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,204 INFO L448 ceAbstractionStarter]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,205 INFO L448 ceAbstractionStarter]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,206 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,207 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-01-12 04:58:22,207 INFO L448 ceAbstractionStarter]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,210 INFO L448 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2019-01-12 04:58:22,210 INFO L448 ceAbstractionStarter]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,210 INFO L448 ceAbstractionStarter]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,210 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,210 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,210 INFO L448 ceAbstractionStarter]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2019-01-12 04:58:22,210 INFO L448 ceAbstractionStarter]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2019-01-12 04:58:22,210 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,210 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,211 INFO L448 ceAbstractionStarter]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,212 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,212 INFO L448 ceAbstractionStarter]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,214 INFO L448 ceAbstractionStarter]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,214 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,214 INFO L448 ceAbstractionStarter]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,214 INFO L448 ceAbstractionStarter]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,214 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2019-01-12 04:58:22,214 INFO L448 ceAbstractionStarter]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2019-01-12 04:58:22,214 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-01-12 04:58:22,214 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-01-12 04:58:22,214 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L838(lines 838 846) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,215 INFO L448 ceAbstractionStarter]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L710(lines 710 718) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,216 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-01-12 04:58:22,217 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-12 04:58:22,217 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,219 INFO L448 ceAbstractionStarter]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,219 INFO L448 ceAbstractionStarter]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,219 INFO L448 ceAbstractionStarter]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,219 INFO L448 ceAbstractionStarter]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,219 INFO L448 ceAbstractionStarter]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,219 INFO L448 ceAbstractionStarter]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2019-01-12 04:58:22,219 INFO L448 ceAbstractionStarter]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2019-01-12 04:58:22,221 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,221 INFO L448 ceAbstractionStarter]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,221 INFO L448 ceAbstractionStarter]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,221 INFO L448 ceAbstractionStarter]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,221 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-01-12 04:58:22,221 INFO L448 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2019-01-12 04:58:22,221 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,221 INFO L448 ceAbstractionStarter]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,221 INFO L448 ceAbstractionStarter]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 858) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2019-01-12 04:58:22,222 INFO L448 ceAbstractionStarter]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,223 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,223 INFO L448 ceAbstractionStarter]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,223 INFO L448 ceAbstractionStarter]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,223 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2019-01-12 04:58:22,223 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2019-01-12 04:58:22,224 INFO L444 ceAbstractionStarter]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse27 (+ ~a14~0 182))) (let ((.cse12 (= 2 ~a24~0)) (.cse14 (<= .cse27 0)) (.cse26 (+ ~a14~0 114)) (.cse20 (< 124 ~a26~0)) (.cse13 (<= (+ ~a26~0 68) 0)) (.cse9 (< 0 .cse27))) (let ((.cse8 (or .cse20 .cse13 .cse9)) (.cse1 (<= ~a26~0 600058)) (.cse3 (<= 183 ~a28~0)) (.cse15 (< 0 .cse26)) (.cse22 (<= .cse26 0)) (.cse7 (<= (+ ~a14~0 84) 0)) (.cse5 (<= ~a28~0 300)) (.cse10 (<= ~a26~0 599553)) (.cse6 (= ~a24~0 1)) (.cse2 (<= 0 (+ ~a14~0 460126))) (.cse18 (< 37 ~a28~0)) (.cse11 (<= ~a28~0 653924)) (.cse23 (= 3 ~a24~0)) (.cse17 (<= ~a26~0 217)) (.cse0 (and .cse12 .cse14)) (.cse16 (<= 125 ~a26~0)) (.cse4 (<= ~a21~0 124))) (or (and .cse0 .cse1 .cse2 (<= ~a28~0 279) .cse3 .cse4) (and .cse5 (and .cse6 .cse7)) (and .cse6 .cse8 .cse7) (and .cse9 .cse10 .cse11 .cse12 .cse4) (and (and (and .cse13 .cse14) .cse4) .cse11) (and .cse11 .cse12 (<= ~a26~0 559736) .cse4) (and .cse1 .cse5 .cse15 .cse12 .cse4) (and (and .cse16 .cse17 .cse7 .cse4 .cse12) .cse15) (and .cse6 .cse8 (<= ~a26~0 169)) (and .cse2 (and .cse1 .cse12 .cse18 .cse4) (<= ~a28~0 134) .cse14) (and (exists ((v_prenex_1 Int)) (let ((.cse19 (div (+ v_prenex_1 (- 600036)) 5))) (and (= 0 (mod (+ v_prenex_1 4) 5)) (= 0 (mod .cse19 5)) (<= v_prenex_1 111) (<= ~a28~0 (div .cse19 5))))) .cse6 (<= ~a21~0 127)) (and .cse4 .cse10 .cse12 (exists ((v_prenex_17 Int)) (and (<= 0 v_prenex_17) (<= (+ ~a28~0 299982) (mod v_prenex_17 300018))))) (and .cse20 .cse6 .cse17) (and (and .cse9 (and .cse11 (and (exists ((v_prenex_12 Int)) (let ((.cse21 (mod v_prenex_12 95))) (and (<= (+ v_prenex_12 68) 0) (<= ~a26~0 (+ .cse21 121)) (= 0 .cse21)))) .cse22 .cse23) .cse4)) .cse3) (and .cse3 .cse11 .cse4 .cse10 .cse12) (and .cse15 (or (and (and .cse13 .cse12) .cse7 .cse4) (and (and (<= ~a24~0 2) (exists ((v_prenex_10 Int)) (let ((.cse24 (* 9 v_prenex_10))) (and (<= 0 .cse24) (<= (+ ~a26~0 554854) (div .cse24 10)) (<= v_prenex_10 222) (<= 222 v_prenex_10)))) .cse7) .cse4))) (and (and .cse5 (and (and .cse13 .cse22) .cse4)) .cse18) (and (and (and .cse5 .cse7) (<= (+ ~a26~0 40337) 0) .cse4) .cse18) (and .cse5 .cse10 .cse18 .cse12 .cse4) (let ((.cse25 (+ ~a14~0 79))) (and (<= .cse25 0) (<= 222 ~a26~0) .cse4 (<= ~a26~0 222) .cse6 (<= ~a28~0 111) (<= 0 .cse25) (<= 111 ~a28~0))) (and .cse2 (and .cse11 .cse23 (<= ~a26~0 120) .cse14 .cse4) .cse18) (and .cse11 (and (and (not .cse23) .cse13) .cse4)) (and (and .cse17 (and .cse0 .cse16)) .cse4))))) [2019-01-12 04:58:22,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:58:22,224 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,224 INFO L448 ceAbstractionStarter]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,224 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2019-01-12 04:58:22,224 INFO L448 ceAbstractionStarter]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,224 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,224 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,225 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-01-12 04:58:22,231 INFO L448 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2019-01-12 04:58:22,231 INFO L448 ceAbstractionStarter]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,231 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,232 INFO L444 ceAbstractionStarter]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse27 (+ ~a14~0 182))) (let ((.cse12 (= 2 ~a24~0)) (.cse14 (<= .cse27 0)) (.cse26 (+ ~a14~0 114)) (.cse20 (< 124 ~a26~0)) (.cse13 (<= (+ ~a26~0 68) 0)) (.cse9 (< 0 .cse27))) (let ((.cse8 (or .cse20 .cse13 .cse9)) (.cse1 (<= ~a26~0 600058)) (.cse3 (<= 183 ~a28~0)) (.cse15 (< 0 .cse26)) (.cse22 (<= .cse26 0)) (.cse7 (<= (+ ~a14~0 84) 0)) (.cse5 (<= ~a28~0 300)) (.cse10 (<= ~a26~0 599553)) (.cse6 (= ~a24~0 1)) (.cse2 (<= 0 (+ ~a14~0 460126))) (.cse18 (< 37 ~a28~0)) (.cse11 (<= ~a28~0 653924)) (.cse23 (= 3 ~a24~0)) (.cse17 (<= ~a26~0 217)) (.cse0 (and .cse12 .cse14)) (.cse16 (<= 125 ~a26~0)) (.cse4 (<= ~a21~0 124))) (or (and .cse0 .cse1 .cse2 (<= ~a28~0 279) .cse3 .cse4) (and .cse5 (and .cse6 .cse7)) (and .cse6 .cse8 .cse7) (and .cse9 .cse10 .cse11 .cse12 .cse4) (and (and (and .cse13 .cse14) .cse4) .cse11) (and .cse11 .cse12 (<= ~a26~0 559736) .cse4) (and .cse1 .cse5 .cse15 .cse12 .cse4) (and (and .cse16 .cse17 .cse7 .cse4 .cse12) .cse15) (and .cse6 .cse8 (<= ~a26~0 169)) (and .cse2 (and .cse1 .cse12 .cse18 .cse4) (<= ~a28~0 134) .cse14) (and (exists ((v_prenex_1 Int)) (let ((.cse19 (div (+ v_prenex_1 (- 600036)) 5))) (and (= 0 (mod (+ v_prenex_1 4) 5)) (= 0 (mod .cse19 5)) (<= v_prenex_1 111) (<= ~a28~0 (div .cse19 5))))) .cse6 (<= ~a21~0 127)) (and .cse4 .cse10 .cse12 (exists ((v_prenex_17 Int)) (and (<= 0 v_prenex_17) (<= (+ ~a28~0 299982) (mod v_prenex_17 300018))))) (and .cse20 .cse6 .cse17) (and (and .cse9 (and .cse11 (and (exists ((v_prenex_12 Int)) (let ((.cse21 (mod v_prenex_12 95))) (and (<= (+ v_prenex_12 68) 0) (<= ~a26~0 (+ .cse21 121)) (= 0 .cse21)))) .cse22 .cse23) .cse4)) .cse3) (and .cse3 .cse11 .cse4 .cse10 .cse12) (and .cse15 (or (and (and .cse13 .cse12) .cse7 .cse4) (and (and (<= ~a24~0 2) (exists ((v_prenex_10 Int)) (let ((.cse24 (* 9 v_prenex_10))) (and (<= 0 .cse24) (<= (+ ~a26~0 554854) (div .cse24 10)) (<= v_prenex_10 222) (<= 222 v_prenex_10)))) .cse7) .cse4))) (and (and .cse5 (and (and .cse13 .cse22) .cse4)) .cse18) (and (and (and .cse5 .cse7) (<= (+ ~a26~0 40337) 0) .cse4) .cse18) (and .cse5 .cse10 .cse18 .cse12 .cse4) (let ((.cse25 (+ ~a14~0 79))) (and (<= .cse25 0) (<= 222 ~a26~0) .cse4 (<= ~a26~0 222) .cse6 (<= ~a28~0 111) (<= 0 .cse25) (<= 111 ~a28~0))) (and .cse2 (and .cse11 .cse23 (<= ~a26~0 120) .cse14 .cse4) .cse18) (and .cse11 (and (and (not .cse23) .cse13) .cse4)) (and (and .cse17 (and .cse0 .cse16)) .cse4))))) [2019-01-12 04:58:22,232 INFO L448 ceAbstractionStarter]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,232 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,232 INFO L448 ceAbstractionStarter]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,232 INFO L448 ceAbstractionStarter]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,232 INFO L448 ceAbstractionStarter]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,232 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,232 INFO L448 ceAbstractionStarter]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,232 INFO L448 ceAbstractionStarter]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L451 ceAbstractionStarter]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2019-01-12 04:58:22,233 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 736) no Hoare annotation was computed. [2019-01-12 04:58:22,234 INFO L448 ceAbstractionStarter]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2019-01-12 04:58:22,238 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,238 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,238 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,238 INFO L448 ceAbstractionStarter]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,238 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,238 INFO L448 ceAbstractionStarter]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,238 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,238 INFO L448 ceAbstractionStarter]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,238 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,239 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,239 INFO L448 ceAbstractionStarter]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,239 INFO L448 ceAbstractionStarter]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,239 INFO L448 ceAbstractionStarter]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,239 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-01-12 04:58:22,239 INFO L448 ceAbstractionStarter]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,239 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-01-12 04:58:22,239 INFO L448 ceAbstractionStarter]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,239 INFO L448 ceAbstractionStarter]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,240 INFO L444 ceAbstractionStarter]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse27 (+ ~a14~0 182))) (let ((.cse12 (= 2 ~a24~0)) (.cse14 (<= .cse27 0)) (.cse26 (+ ~a14~0 114)) (.cse20 (< 124 ~a26~0)) (.cse13 (<= (+ ~a26~0 68) 0)) (.cse9 (< 0 .cse27))) (let ((.cse8 (or .cse20 .cse13 .cse9)) (.cse1 (<= ~a26~0 600058)) (.cse3 (<= 183 ~a28~0)) (.cse15 (< 0 .cse26)) (.cse22 (<= .cse26 0)) (.cse7 (<= (+ ~a14~0 84) 0)) (.cse5 (<= ~a28~0 300)) (.cse10 (<= ~a26~0 599553)) (.cse6 (= ~a24~0 1)) (.cse2 (<= 0 (+ ~a14~0 460126))) (.cse18 (< 37 ~a28~0)) (.cse11 (<= ~a28~0 653924)) (.cse23 (= 3 ~a24~0)) (.cse17 (<= ~a26~0 217)) (.cse0 (and .cse12 .cse14)) (.cse16 (<= 125 ~a26~0)) (.cse4 (<= ~a21~0 124))) (or (and .cse0 .cse1 .cse2 (<= ~a28~0 279) .cse3 .cse4) (and .cse5 (and .cse6 .cse7)) (and .cse6 .cse8 .cse7) (and .cse9 .cse10 .cse11 .cse12 .cse4) (and (and (and .cse13 .cse14) .cse4) .cse11) (and .cse11 .cse12 (<= ~a26~0 559736) .cse4) (and .cse1 .cse5 .cse15 .cse12 .cse4) (and (and .cse16 .cse17 .cse7 .cse4 .cse12) .cse15) (and .cse6 .cse8 (<= ~a26~0 169)) (and .cse2 (and .cse1 .cse12 .cse18 .cse4) (<= ~a28~0 134) .cse14) (and (exists ((v_prenex_1 Int)) (let ((.cse19 (div (+ v_prenex_1 (- 600036)) 5))) (and (= 0 (mod (+ v_prenex_1 4) 5)) (= 0 (mod .cse19 5)) (<= v_prenex_1 111) (<= ~a28~0 (div .cse19 5))))) .cse6 (<= ~a21~0 127)) (and .cse4 .cse10 .cse12 (exists ((v_prenex_17 Int)) (and (<= 0 v_prenex_17) (<= (+ ~a28~0 299982) (mod v_prenex_17 300018))))) (and .cse20 .cse6 .cse17) (and (and .cse9 (and .cse11 (and (exists ((v_prenex_12 Int)) (let ((.cse21 (mod v_prenex_12 95))) (and (<= (+ v_prenex_12 68) 0) (<= ~a26~0 (+ .cse21 121)) (= 0 .cse21)))) .cse22 .cse23) .cse4)) .cse3) (and .cse3 .cse11 .cse4 .cse10 .cse12) (and .cse15 (or (and (and .cse13 .cse12) .cse7 .cse4) (and (and (<= ~a24~0 2) (exists ((v_prenex_10 Int)) (let ((.cse24 (* 9 v_prenex_10))) (and (<= 0 .cse24) (<= (+ ~a26~0 554854) (div .cse24 10)) (<= v_prenex_10 222) (<= 222 v_prenex_10)))) .cse7) .cse4))) (and (and .cse5 (and (and .cse13 .cse22) .cse4)) .cse18) (and (and (and .cse5 .cse7) (<= (+ ~a26~0 40337) 0) .cse4) .cse18) (and .cse5 .cse10 .cse18 .cse12 .cse4) (let ((.cse25 (+ ~a14~0 79))) (and (<= .cse25 0) (<= 222 ~a26~0) .cse4 (<= ~a26~0 222) .cse6 (<= ~a28~0 111) (<= 0 .cse25) (<= 111 ~a28~0))) (and .cse2 (and .cse11 .cse23 (<= ~a26~0 120) .cse14 .cse4) .cse18) (and .cse11 (and (and (not .cse23) .cse13) .cse4)) (and (and .cse17 (and .cse0 .cse16)) .cse4))))) [2019-01-12 04:58:22,240 INFO L448 ceAbstractionStarter]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,240 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,240 INFO L448 ceAbstractionStarter]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,240 INFO L448 ceAbstractionStarter]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,240 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,240 INFO L448 ceAbstractionStarter]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,240 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-01-12 04:58:22,240 INFO L448 ceAbstractionStarter]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,241 INFO L448 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2019-01-12 04:58:22,241 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 605) no Hoare annotation was computed. [2019-01-12 04:58:22,243 INFO L448 ceAbstractionStarter]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2019-01-12 04:58:22,243 INFO L448 ceAbstractionStarter]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,243 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,243 INFO L448 ceAbstractionStarter]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2019-01-12 04:58:22,243 INFO L448 ceAbstractionStarter]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2019-01-12 04:58:22,243 INFO L448 ceAbstractionStarter]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2019-01-12 04:58:22,243 INFO L448 ceAbstractionStarter]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2019-01-12 04:58:22,243 INFO L448 ceAbstractionStarter]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,246 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,246 INFO L448 ceAbstractionStarter]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,246 INFO L448 ceAbstractionStarter]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,246 INFO L448 ceAbstractionStarter]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,246 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,246 INFO L448 ceAbstractionStarter]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,246 INFO L448 ceAbstractionStarter]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,246 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,246 INFO L448 ceAbstractionStarter]: For program point L206(line 206) no Hoare annotation was computed. [2019-01-12 04:58:22,246 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L2585(line 2585) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2019-01-12 04:58:22,247 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L607(lines 607 617) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-01-12 04:58:22,248 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,249 INFO L448 ceAbstractionStarter]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,249 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,254 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,254 INFO L448 ceAbstractionStarter]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,254 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,254 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,254 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,254 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,254 INFO L448 ceAbstractionStarter]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,254 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L749(lines 749 760) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,256 INFO L448 ceAbstractionStarter]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,257 INFO L448 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2019-01-12 04:58:22,257 INFO L448 ceAbstractionStarter]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,260 INFO L448 ceAbstractionStarter]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,260 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,260 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,260 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,260 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,260 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,260 INFO L448 ceAbstractionStarter]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,260 INFO L448 ceAbstractionStarter]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,260 INFO L448 ceAbstractionStarter]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2019-01-12 04:58:22,261 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,262 INFO L448 ceAbstractionStarter]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2019-01-12 04:58:22,263 INFO L448 ceAbstractionStarter]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2019-01-12 04:58:22,266 INFO L448 ceAbstractionStarter]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,266 INFO L448 ceAbstractionStarter]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,266 INFO L448 ceAbstractionStarter]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,266 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,266 INFO L448 ceAbstractionStarter]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2019-01-12 04:58:22,266 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 633) no Hoare annotation was computed. [2019-01-12 04:58:22,266 INFO L448 ceAbstractionStarter]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2019-01-12 04:58:22,266 INFO L448 ceAbstractionStarter]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2019-01-12 04:58:22,267 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2019-01-12 04:58:22,300 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,303 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,304 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,305 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,343 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,343 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,344 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,345 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,346 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,349 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,356 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,361 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,362 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,393 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,402 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,404 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,411 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,412 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:58:22 BoogieIcfgContainer [2019-01-12 04:58:22,421 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:58:22,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:58:22,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:58:22,422 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:58:22,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:49:50" (3/4) ... [2019-01-12 04:58:22,433 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:58:22,512 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:58:22,517 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:58:22,564 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || ((((0 < a14 + 182 && a26 <= 599553) && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (((a28 <= 653924 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || (((a21 <= 124 && a26 <= 599553) && 2 == a24) && (\exists v_prenex_17 : int :: 0 <= v_prenex_17 && a28 + 299982 <= v_prenex_17 % 300018))) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124) && 183 <= a28)) || ((((183 <= a28 && a28 <= 653924) && a21 <= 124) && a26 <= 599553) && 2 == a24)) || (0 < a14 + 114 && ((((a26 + 68 <= 0 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) || (((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && a14 + 84 <= 0) && a21 <= 124)))) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a26 <= 599553) && 37 < a28) && 2 == a24) && a21 <= 124)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((0 <= a14 + 460126 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 37 < a28)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) [2019-01-12 04:58:22,569 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || ((((0 < a14 + 182 && a26 <= 599553) && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (((a28 <= 653924 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || (((a21 <= 124 && a26 <= 599553) && 2 == a24) && (\exists v_prenex_17 : int :: 0 <= v_prenex_17 && a28 + 299982 <= v_prenex_17 % 300018))) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124) && 183 <= a28)) || ((((183 <= a28 && a28 <= 653924) && a21 <= 124) && a26 <= 599553) && 2 == a24)) || (0 < a14 + 114 && ((((a26 + 68 <= 0 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) || (((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && a14 + 84 <= 0) && a21 <= 124)))) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a26 <= 599553) && 37 < a28) && 2 == a24) && a21 <= 124)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((0 <= a14 + 460126 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 37 < a28)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) [2019-01-12 04:58:22,584 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || ((((0 < a14 + 182 && a26 <= 599553) && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (((a28 <= 653924 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || (((a21 <= 124 && a26 <= 599553) && 2 == a24) && (\exists v_prenex_17 : int :: 0 <= v_prenex_17 && a28 + 299982 <= v_prenex_17 % 300018))) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124) && 183 <= a28)) || ((((183 <= a28 && a28 <= 653924) && a21 <= 124) && a26 <= 599553) && 2 == a24)) || (0 < a14 + 114 && ((((a26 + 68 <= 0 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) || (((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && a14 + 84 <= 0) && a21 <= 124)))) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a26 <= 599553) && 37 < a28) && 2 == a24) && a21 <= 124)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((0 <= a14 + 460126 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 37 < a28)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) [2019-01-12 04:58:22,861 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:58:22,861 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:58:22,862 INFO L168 Benchmark]: Toolchain (without parser) took 523245.56 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 936.5 MB in the beginning and 1.1 GB in the end (delta: -116.5 MB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-01-12 04:58:22,862 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:58:22,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1682.71 ms. Allocated memory is still 1.0 GB. Free memory was 936.5 MB in the beginning and 802.2 MB in the end (delta: 134.2 MB). Peak memory consumption was 134.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:58:22,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 468.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 802.2 MB in the beginning and 1.1 GB in the end (delta: -292.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:58:22,863 INFO L168 Benchmark]: Boogie Preprocessor took 278.33 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: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2019-01-12 04:58:22,863 INFO L168 Benchmark]: RCFGBuilder took 8467.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.2 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. [2019-01-12 04:58:22,868 INFO L168 Benchmark]: TraceAbstraction took 511901.67 ms. Allocated memory was 1.3 GB in the beginning and 4.9 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -99.4 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-01-12 04:58:22,869 INFO L168 Benchmark]: Witness Printer took 439.46 ms. Allocated memory is still 4.9 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 75.3 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:58:22,874 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1682.71 ms. Allocated memory is still 1.0 GB. Free memory was 936.5 MB in the beginning and 802.2 MB in the end (delta: 134.2 MB). Peak memory consumption was 134.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 468.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 802.2 MB in the beginning and 1.1 GB in the end (delta: -292.7 MB). Peak memory consumption was 40.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 278.33 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: 33.9 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 8467.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 121.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.2 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 511901.67 ms. Allocated memory was 1.3 GB in the beginning and 4.9 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -99.4 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 439.46 ms. Allocated memory is still 4.9 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 75.3 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 173]: 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: 2574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant [2019-01-12 04:58:22,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,900 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,900 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,900 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,901 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,901 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,901 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,901 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,904 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,904 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,904 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,905 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || ((((0 < a14 + 182 && a26 <= 599553) && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (((a28 <= 653924 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || (((a21 <= 124 && a26 <= 599553) && 2 == a24) && (\exists v_prenex_17 : int :: 0 <= v_prenex_17 && a28 + 299982 <= v_prenex_17 % 300018))) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124) && 183 <= a28)) || ((((183 <= a28 && a28 <= 653924) && a21 <= 124) && a26 <= 599553) && 2 == a24)) || (0 < a14 + 114 && ((((a26 + 68 <= 0 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) || (((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && a14 + 84 <= 0) && a21 <= 124)))) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a26 <= 599553) && 37 < a28) && 2 == a24) && a21 <= 124)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((0 <= a14 + 460126 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 37 < a28)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) - InvariantResult [Line: 1646]: Loop Invariant [2019-01-12 04:58:22,906 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,909 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,909 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,910 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,914 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,915 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,919 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,919 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,919 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,919 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,923 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,924 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,925 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || ((((0 < a14 + 182 && a26 <= 599553) && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (((a28 <= 653924 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || (((a21 <= 124 && a26 <= 599553) && 2 == a24) && (\exists v_prenex_17 : int :: 0 <= v_prenex_17 && a28 + 299982 <= v_prenex_17 % 300018))) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124) && 183 <= a28)) || ((((183 <= a28 && a28 <= 653924) && a21 <= 124) && a26 <= 599553) && 2 == a24)) || (0 < a14 + 114 && ((((a26 + 68 <= 0 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) || (((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && a14 + 84 <= 0) && a21 <= 124)))) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a26 <= 599553) && 37 < a28) && 2 == a24) && a21 <= 124)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((0 <= a14 + 460126 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 37 < a28)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) - InvariantResult [Line: 24]: Loop Invariant [2019-01-12 04:58:22,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,926 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,927 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,929 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,930 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,930 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,930 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,930 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,931 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,937 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-01-12 04:58:22,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 04:58:22,938 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2019-01-12 04:58:22,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2019-01-12 04:58:22,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || ((((0 < a14 + 182 && a26 <= 599553) && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (((a28 <= 653924 && 2 == a24) && a26 <= 559736) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || (((a21 <= 124 && a26 <= 599553) && 2 == a24) && (\exists v_prenex_17 : int :: 0 <= v_prenex_17 && a28 + 299982 <= v_prenex_17 % 300018))) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124) && 183 <= a28)) || ((((183 <= a28 && a28 <= 653924) && a21 <= 124) && a26 <= 599553) && 2 == a24)) || (0 < a14 + 114 && ((((a26 + 68 <= 0 && 2 == a24) && a14 + 84 <= 0) && a21 <= 124) || (((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && a14 + 84 <= 0) && a21 <= 124)))) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || ((((a28 <= 300 && a26 <= 599553) && 37 < a28) && 2 == a24) && a21 <= 124)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((0 <= a14 + 460126 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 37 < a28)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. SAFE Result, 511.6s OverallTime, 28 OverallIterations, 11 TraceHistogramMax, 392.7s AutomataDifference, 0.0s DeadEndRemovalTime, 55.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 8085 SDtfs, 43835 SDslu, 3330 SDs, 0 SdLazy, 103198 SolverSat, 13585 SolverUnsat, 127 SolverUnknown, 0 SolverNotchecked, 354.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4519 GetRequests, 4402 SyntacticMatches, 10 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63468occurred in iteration=25, 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: 13.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 196408 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 517 NumberOfFragments, 1651 HoareAnnotationTreeSize, 4 FomulaSimplifications, 416031255 FormulaSimplificationTreeSizeReduction, 11.2s HoareSimplificationTime, 4 FomulaSimplificationsInter, 129531492 FormulaSimplificationTreeSizeReductionInter, 44.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 26.0s InterpolantComputationTime, 27563 NumberOfCodeBlocks, 27563 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 27528 ConstructedInterpolants, 924 QuantifiedInterpolants, 100678467 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5312 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 35 InterpolantComputations, 24 PerfectInterpolantSequences, 50182/52641 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...