java -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label40_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:04:24,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:04:24,705 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:04:24,720 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:04:24,721 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:04:24,722 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:04:24,724 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:04:24,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:04:24,729 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:04:24,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:04:24,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:04:24,739 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:04:24,740 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:04:24,740 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:04:24,744 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:04:24,744 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:04:24,745 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:04:24,747 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:04:24,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:04:24,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:04:24,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:04:24,758 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:04:24,761 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:04:24,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:04:24,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:04:24,763 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:04:24,764 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:04:24,765 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:04:24,765 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:04:24,768 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:04:24,768 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:04:24,770 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:04:24,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:04:24,772 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:04:24,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:04:24,774 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:04:24,775 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:04:24,797 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:04:24,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:04:24,798 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:04:24,798 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:04:24,799 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:04:24,799 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:04:24,799 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:04:24,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:04:24,801 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:04:24,801 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:04:24,801 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:04:24,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:04:24,802 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:04:24,802 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:04:24,802 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:04:24,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:04:24,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:04:24,803 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:04:24,803 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:04:24,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:04:24,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:04:24,803 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:04:24,803 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:04:24,804 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:04:24,804 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:04:24,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:04:24,804 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:04:24,804 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:04:24,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:04:24,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:04:24,876 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:04:24,878 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:04:24,878 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:04:24,879 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label40_true-unreach-call.c [2018-11-06 21:04:24,947 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dcd7b79/225104dd54154241807f3e4ca1bd0964/FLAG3b3365f05 [2018-11-06 21:04:25,549 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:04:25,551 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label40_true-unreach-call.c [2018-11-06 21:04:25,566 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dcd7b79/225104dd54154241807f3e4ca1bd0964/FLAG3b3365f05 [2018-11-06 21:04:25,586 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dcd7b79/225104dd54154241807f3e4ca1bd0964 [2018-11-06 21:04:25,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:04:25,601 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:04:25,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:04:25,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:04:25,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:04:25,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:04:25" (1/1) ... [2018-11-06 21:04:25,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4594bf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:25, skipping insertion in model container [2018-11-06 21:04:25,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:04:25" (1/1) ... [2018-11-06 21:04:25,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:04:25,713 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:04:26,335 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:04:26,339 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:04:26,580 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:04:26,606 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:04:26,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26 WrapperNode [2018-11-06 21:04:26,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:04:26,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:04:26,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:04:26,609 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:04:26,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (1/1) ... [2018-11-06 21:04:26,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (1/1) ... [2018-11-06 21:04:26,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:04:26,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:04:26,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:04:26,892 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:04:26,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (1/1) ... [2018-11-06 21:04:26,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (1/1) ... [2018-11-06 21:04:26,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (1/1) ... [2018-11-06 21:04:26,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (1/1) ... [2018-11-06 21:04:26,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (1/1) ... [2018-11-06 21:04:26,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (1/1) ... [2018-11-06 21:04:26,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (1/1) ... [2018-11-06 21:04:27,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:04:27,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:04:27,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:04:27,013 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:04:27,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:04:27,085 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:04:27,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:04:27,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:04:31,989 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:04:31,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:04:31 BoogieIcfgContainer [2018-11-06 21:04:31,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:04:31,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:04:31,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:04:31,995 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:04:31,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:04:25" (1/3) ... [2018-11-06 21:04:31,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ac69ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:04:31, skipping insertion in model container [2018-11-06 21:04:31,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:04:26" (2/3) ... [2018-11-06 21:04:31,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ac69ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:04:31, skipping insertion in model container [2018-11-06 21:04:31,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:04:31" (3/3) ... [2018-11-06 21:04:31,999 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label40_true-unreach-call.c [2018-11-06 21:04:32,009 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:04:32,019 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:04:32,037 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:04:32,075 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:04:32,075 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:04:32,076 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:04:32,076 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:04:32,076 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:04:32,078 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:04:32,078 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:04:32,078 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:04:32,079 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:04:32,104 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:04:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-06 21:04:32,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:32,114 INFO L375 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] [2018-11-06 21:04:32,117 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:32,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 147574146, now seen corresponding path program 1 times [2018-11-06 21:04:32,126 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:32,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:32,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:32,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:32,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:32,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:32,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:32,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:32,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:32,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:32,640 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:04:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:35,921 INFO L93 Difference]: Finished difference Result 955 states and 1722 transitions. [2018-11-06 21:04:35,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:35,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-06 21:04:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:35,947 INFO L225 Difference]: With dead ends: 955 [2018-11-06 21:04:35,948 INFO L226 Difference]: Without dead ends: 664 [2018-11-06 21:04:35,953 INFO L604 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 [2018-11-06 21:04:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-11-06 21:04:36,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 472. [2018-11-06 21:04:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-11-06 21:04:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 716 transitions. [2018-11-06 21:04:36,050 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 716 transitions. Word has length 45 [2018-11-06 21:04:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:36,050 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 716 transitions. [2018-11-06 21:04:36,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:36,051 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 716 transitions. [2018-11-06 21:04:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-06 21:04:36,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:36,055 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:36,056 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:36,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:36,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1700157718, now seen corresponding path program 1 times [2018-11-06 21:04:36,056 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:36,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:36,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:36,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:36,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:36,345 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:36,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:36,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:36,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:36,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:36,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:36,348 INFO L87 Difference]: Start difference. First operand 472 states and 716 transitions. Second operand 4 states. [2018-11-06 21:04:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:39,659 INFO L93 Difference]: Finished difference Result 1700 states and 2661 transitions. [2018-11-06 21:04:39,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:39,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-11-06 21:04:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:39,668 INFO L225 Difference]: With dead ends: 1700 [2018-11-06 21:04:39,668 INFO L226 Difference]: Without dead ends: 1230 [2018-11-06 21:04:39,672 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2018-11-06 21:04:39,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1216. [2018-11-06 21:04:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-06 21:04:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1756 transitions. [2018-11-06 21:04:39,729 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1756 transitions. Word has length 114 [2018-11-06 21:04:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:39,730 INFO L480 AbstractCegarLoop]: Abstraction has 1216 states and 1756 transitions. [2018-11-06 21:04:39,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1756 transitions. [2018-11-06 21:04:39,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-06 21:04:39,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:39,734 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:39,734 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:39,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:39,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1258966910, now seen corresponding path program 1 times [2018-11-06 21:04:39,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:39,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:39,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:40,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:40,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:40,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:40,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:40,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:40,054 INFO L87 Difference]: Start difference. First operand 1216 states and 1756 transitions. Second operand 4 states. [2018-11-06 21:04:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:44,126 INFO L93 Difference]: Finished difference Result 4494 states and 6609 transitions. [2018-11-06 21:04:44,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:44,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-11-06 21:04:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:44,144 INFO L225 Difference]: With dead ends: 4494 [2018-11-06 21:04:44,144 INFO L226 Difference]: Without dead ends: 3280 [2018-11-06 21:04:44,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:44,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2018-11-06 21:04:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 2327. [2018-11-06 21:04:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2018-11-06 21:04:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3050 transitions. [2018-11-06 21:04:44,200 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3050 transitions. Word has length 122 [2018-11-06 21:04:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:44,200 INFO L480 AbstractCegarLoop]: Abstraction has 2327 states and 3050 transitions. [2018-11-06 21:04:44,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3050 transitions. [2018-11-06 21:04:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-06 21:04:44,204 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:44,204 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:44,204 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:44,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:44,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1763364140, now seen corresponding path program 1 times [2018-11-06 21:04:44,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:44,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:44,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:44,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:44,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:44,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:44,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:04:44,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:04:44,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:44,622 INFO L87 Difference]: Start difference. First operand 2327 states and 3050 transitions. Second operand 5 states. [2018-11-06 21:04:48,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:48,604 INFO L93 Difference]: Finished difference Result 8397 states and 11572 transitions. [2018-11-06 21:04:48,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:04:48,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 173 [2018-11-06 21:04:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:48,634 INFO L225 Difference]: With dead ends: 8397 [2018-11-06 21:04:48,634 INFO L226 Difference]: Without dead ends: 6257 [2018-11-06 21:04:48,638 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6257 states. [2018-11-06 21:04:48,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6257 to 6256. [2018-11-06 21:04:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6256 states. [2018-11-06 21:04:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6256 states to 6256 states and 8206 transitions. [2018-11-06 21:04:48,750 INFO L78 Accepts]: Start accepts. Automaton has 6256 states and 8206 transitions. Word has length 173 [2018-11-06 21:04:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:48,751 INFO L480 AbstractCegarLoop]: Abstraction has 6256 states and 8206 transitions. [2018-11-06 21:04:48,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:04:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 6256 states and 8206 transitions. [2018-11-06 21:04:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-06 21:04:48,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:48,762 INFO L375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:04:48,762 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:48,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:48,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1860336133, now seen corresponding path program 1 times [2018-11-06 21:04:48,762 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:48,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:48,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:48,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:48,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:49,140 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 21:04:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-06 21:04:49,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:49,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:49,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:49,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:49,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:49,247 INFO L87 Difference]: Start difference. First operand 6256 states and 8206 transitions. Second operand 4 states. [2018-11-06 21:04:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:51,563 INFO L93 Difference]: Finished difference Result 14198 states and 18819 transitions. [2018-11-06 21:04:51,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:51,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2018-11-06 21:04:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:51,597 INFO L225 Difference]: With dead ends: 14198 [2018-11-06 21:04:51,598 INFO L226 Difference]: Without dead ends: 8129 [2018-11-06 21:04:51,607 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2018-11-06 21:04:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 8106. [2018-11-06 21:04:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8106 states. [2018-11-06 21:04:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8106 states to 8106 states and 10275 transitions. [2018-11-06 21:04:51,741 INFO L78 Accepts]: Start accepts. Automaton has 8106 states and 10275 transitions. Word has length 251 [2018-11-06 21:04:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:51,741 INFO L480 AbstractCegarLoop]: Abstraction has 8106 states and 10275 transitions. [2018-11-06 21:04:51,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 8106 states and 10275 transitions. [2018-11-06 21:04:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-11-06 21:04:51,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:51,758 INFO L375 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:04:51,759 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:51,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash -887588984, now seen corresponding path program 1 times [2018-11-06 21:04:51,759 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:51,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:51,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:51,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:51,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:52,392 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 21:04:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-06 21:04:52,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:52,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:52,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:52,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:52,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:52,462 INFO L87 Difference]: Start difference. First operand 8106 states and 10275 transitions. Second operand 4 states. [2018-11-06 21:04:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:54,585 INFO L93 Difference]: Finished difference Result 17893 states and 22908 transitions. [2018-11-06 21:04:54,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:54,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2018-11-06 21:04:54,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:54,622 INFO L225 Difference]: With dead ends: 17893 [2018-11-06 21:04:54,622 INFO L226 Difference]: Without dead ends: 9974 [2018-11-06 21:04:54,630 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9974 states. [2018-11-06 21:04:54,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9974 to 9771. [2018-11-06 21:04:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9771 states. [2018-11-06 21:04:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9771 states to 9771 states and 12053 transitions. [2018-11-06 21:04:54,777 INFO L78 Accepts]: Start accepts. Automaton has 9771 states and 12053 transitions. Word has length 331 [2018-11-06 21:04:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:54,778 INFO L480 AbstractCegarLoop]: Abstraction has 9771 states and 12053 transitions. [2018-11-06 21:04:54,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 9771 states and 12053 transitions. [2018-11-06 21:04:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-11-06 21:04:54,796 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:54,796 INFO L375 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2018-11-06 21:04:54,797 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:54,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:54,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1750501443, now seen corresponding path program 1 times [2018-11-06 21:04:54,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:54,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:54,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:54,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:54,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:55,189 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-06 21:04:55,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:55,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:04:55,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:04:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:04:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:04:55,190 INFO L87 Difference]: Start difference. First operand 9771 states and 12053 transitions. Second operand 3 states. [2018-11-06 21:04:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:56,294 INFO L93 Difference]: Finished difference Result 20471 states and 25180 transitions. [2018-11-06 21:04:56,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:04:56,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 340 [2018-11-06 21:04:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:56,316 INFO L225 Difference]: With dead ends: 20471 [2018-11-06 21:04:56,316 INFO L226 Difference]: Without dead ends: 9575 [2018-11-06 21:04:56,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:04:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9575 states. [2018-11-06 21:04:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9575 to 9572. [2018-11-06 21:04:56,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9572 states. [2018-11-06 21:04:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9572 states to 9572 states and 11569 transitions. [2018-11-06 21:04:56,440 INFO L78 Accepts]: Start accepts. Automaton has 9572 states and 11569 transitions. Word has length 340 [2018-11-06 21:04:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:56,441 INFO L480 AbstractCegarLoop]: Abstraction has 9572 states and 11569 transitions. [2018-11-06 21:04:56,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:04:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 9572 states and 11569 transitions. [2018-11-06 21:04:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-11-06 21:04:56,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:56,457 INFO L375 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:04:56,457 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:56,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:56,458 INFO L82 PathProgramCache]: Analyzing trace with hash -623402235, now seen corresponding path program 1 times [2018-11-06 21:04:56,458 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:56,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:56,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:56,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:56,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 167 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:57,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:57,485 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:57,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:57,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 167 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:04:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:04:58,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-11-06 21:04:58,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:04:58,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:04:58,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:04:58,528 INFO L87 Difference]: Start difference. First operand 9572 states and 11569 transitions. Second operand 9 states. [2018-11-06 21:05:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:09,057 INFO L93 Difference]: Finished difference Result 34574 states and 42645 transitions. [2018-11-06 21:05:09,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:05:09,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 345 [2018-11-06 21:05:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:09,115 INFO L225 Difference]: With dead ends: 34574 [2018-11-06 21:05:09,115 INFO L226 Difference]: Without dead ends: 25189 [2018-11-06 21:05:09,130 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 346 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:05:09,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25189 states. [2018-11-06 21:05:09,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25189 to 16973. [2018-11-06 21:05:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16973 states. [2018-11-06 21:05:09,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16973 states to 16973 states and 19725 transitions. [2018-11-06 21:05:09,513 INFO L78 Accepts]: Start accepts. Automaton has 16973 states and 19725 transitions. Word has length 345 [2018-11-06 21:05:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:09,514 INFO L480 AbstractCegarLoop]: Abstraction has 16973 states and 19725 transitions. [2018-11-06 21:05:09,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:05:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 16973 states and 19725 transitions. [2018-11-06 21:05:09,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-11-06 21:05:09,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:09,544 INFO L375 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:09,544 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:09,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:09,545 INFO L82 PathProgramCache]: Analyzing trace with hash -292184617, now seen corresponding path program 1 times [2018-11-06 21:05:09,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:09,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:09,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:09,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:09,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:10,556 WARN L179 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-11-06 21:05:11,028 WARN L179 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-11-06 21:05:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 266 proven. 106 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-06 21:05:11,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:11,180 INFO L225 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 [2018-11-06 21:05:11,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:11,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 309 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2018-11-06 21:05:11,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:11,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-11-06 21:05:11,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 21:05:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 21:05:11,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-06 21:05:11,692 INFO L87 Difference]: Start difference. First operand 16973 states and 19725 transitions. Second operand 9 states. [2018-11-06 21:05:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:20,765 INFO L93 Difference]: Finished difference Result 48979 states and 56292 transitions. [2018-11-06 21:05:20,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-06 21:05:20,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 356 [2018-11-06 21:05:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:20,810 INFO L225 Difference]: With dead ends: 48979 [2018-11-06 21:05:20,810 INFO L226 Difference]: Without dead ends: 22873 [2018-11-06 21:05:20,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-11-06 21:05:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22873 states. [2018-11-06 21:05:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22873 to 19156. [2018-11-06 21:05:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19156 states. [2018-11-06 21:05:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19156 states to 19156 states and 21051 transitions. [2018-11-06 21:05:21,079 INFO L78 Accepts]: Start accepts. Automaton has 19156 states and 21051 transitions. Word has length 356 [2018-11-06 21:05:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:21,080 INFO L480 AbstractCegarLoop]: Abstraction has 19156 states and 21051 transitions. [2018-11-06 21:05:21,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 21:05:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 19156 states and 21051 transitions. [2018-11-06 21:05:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-11-06 21:05:21,109 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:21,109 INFO L375 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, 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, 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] [2018-11-06 21:05:21,110 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:21,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1238625643, now seen corresponding path program 1 times [2018-11-06 21:05:21,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:21,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:21,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:21,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:22,324 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 604 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-06 21:05:22,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:22,324 INFO L225 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 [2018-11-06 21:05:22,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:22,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:22,816 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 548 DAG size of output: 29 [2018-11-06 21:05:23,763 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 390 proven. 43 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-11-06 21:05:23,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:23,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-06 21:05:23,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:05:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:05:23,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:05:23,785 INFO L87 Difference]: Start difference. First operand 19156 states and 21051 transitions. Second operand 8 states. [2018-11-06 21:05:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:32,710 INFO L93 Difference]: Finished difference Result 48168 states and 53064 transitions. [2018-11-06 21:05:32,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 21:05:32,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 431 [2018-11-06 21:05:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:32,747 INFO L225 Difference]: With dead ends: 48168 [2018-11-06 21:05:32,747 INFO L226 Difference]: Without dead ends: 28075 [2018-11-06 21:05:32,763 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 440 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2018-11-06 21:05:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28075 states. [2018-11-06 21:05:33,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28075 to 21190. [2018-11-06 21:05:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21190 states. [2018-11-06 21:05:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21190 states to 21190 states and 23098 transitions. [2018-11-06 21:05:33,043 INFO L78 Accepts]: Start accepts. Automaton has 21190 states and 23098 transitions. Word has length 431 [2018-11-06 21:05:33,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:33,044 INFO L480 AbstractCegarLoop]: Abstraction has 21190 states and 23098 transitions. [2018-11-06 21:05:33,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:05:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 21190 states and 23098 transitions. [2018-11-06 21:05:33,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-11-06 21:05:33,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:33,076 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:33,076 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:33,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash -211960133, now seen corresponding path program 1 times [2018-11-06 21:05:33,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:33,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:33,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:33,675 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-06 21:05:34,040 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-11-06 21:05:34,497 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2018-11-06 21:05:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 182 proven. 465 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 21:05:34,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:34,874 INFO L225 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 [2018-11-06 21:05:34,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:35,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:05:35,894 WARN L179 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2018-11-06 21:05:36,348 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 521 DAG size of output: 29 [2018-11-06 21:05:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 308 proven. 339 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-06 21:05:37,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:05:37,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-11-06 21:05:37,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:05:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:05:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:05:37,068 INFO L87 Difference]: Start difference. First operand 21190 states and 23098 transitions. Second operand 12 states. [2018-11-06 21:05:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:47,210 INFO L93 Difference]: Finished difference Result 45340 states and 49465 transitions. [2018-11-06 21:05:47,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-06 21:05:47,210 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 464 [2018-11-06 21:05:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:47,242 INFO L225 Difference]: With dead ends: 45340 [2018-11-06 21:05:47,242 INFO L226 Difference]: Without dead ends: 23969 [2018-11-06 21:05:47,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=160, Invalid=302, Unknown=0, NotChecked=0, Total=462 [2018-11-06 21:05:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23969 states. [2018-11-06 21:05:47,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23969 to 16595. [2018-11-06 21:05:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16595 states. [2018-11-06 21:05:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16595 states to 16595 states and 17775 transitions. [2018-11-06 21:05:47,510 INFO L78 Accepts]: Start accepts. Automaton has 16595 states and 17775 transitions. Word has length 464 [2018-11-06 21:05:47,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:47,511 INFO L480 AbstractCegarLoop]: Abstraction has 16595 states and 17775 transitions. [2018-11-06 21:05:47,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:05:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 16595 states and 17775 transitions. [2018-11-06 21:05:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-11-06 21:05:47,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:47,537 INFO L375 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, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:47,537 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:47,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:47,538 INFO L82 PathProgramCache]: Analyzing trace with hash -72513983, now seen corresponding path program 1 times [2018-11-06 21:05:47,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:47,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:47,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:47,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:47,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2018-11-06 21:05:48,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:48,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:48,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:48,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:48,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:48,081 INFO L87 Difference]: Start difference. First operand 16595 states and 17775 transitions. Second operand 4 states. [2018-11-06 21:05:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:49,113 INFO L93 Difference]: Finished difference Result 30779 states and 33004 transitions. [2018-11-06 21:05:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:05:49,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 549 [2018-11-06 21:05:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:49,131 INFO L225 Difference]: With dead ends: 30779 [2018-11-06 21:05:49,131 INFO L226 Difference]: Without dead ends: 16223 [2018-11-06 21:05:49,143 INFO L604 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 [2018-11-06 21:05:49,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16223 states. [2018-11-06 21:05:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16223 to 14922. [2018-11-06 21:05:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14922 states. [2018-11-06 21:05:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14922 states to 14922 states and 15952 transitions. [2018-11-06 21:05:49,329 INFO L78 Accepts]: Start accepts. Automaton has 14922 states and 15952 transitions. Word has length 549 [2018-11-06 21:05:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:49,330 INFO L480 AbstractCegarLoop]: Abstraction has 14922 states and 15952 transitions. [2018-11-06 21:05:49,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 14922 states and 15952 transitions. [2018-11-06 21:05:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-11-06 21:05:49,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:49,345 INFO L375 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-11-06 21:05:49,345 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:49,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash -448766609, now seen corresponding path program 1 times [2018-11-06 21:05:49,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:49,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:49,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:49,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:49,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:49,824 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2018-11-06 21:05:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1132 backedges. 875 proven. 0 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2018-11-06 21:05:49,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:49,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:49,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:49,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:49,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:49,951 INFO L87 Difference]: Start difference. First operand 14922 states and 15952 transitions. Second operand 4 states. [2018-11-06 21:05:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:51,510 INFO L93 Difference]: Finished difference Result 29852 states and 31910 transitions. [2018-11-06 21:05:51,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:51,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 555 [2018-11-06 21:05:51,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:51,526 INFO L225 Difference]: With dead ends: 29852 [2018-11-06 21:05:51,526 INFO L226 Difference]: Without dead ends: 16410 [2018-11-06 21:05:51,536 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:51,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16410 states. [2018-11-06 21:05:51,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16410 to 14550. [2018-11-06 21:05:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14550 states. [2018-11-06 21:05:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14550 states to 14550 states and 15489 transitions. [2018-11-06 21:05:51,722 INFO L78 Accepts]: Start accepts. Automaton has 14550 states and 15489 transitions. Word has length 555 [2018-11-06 21:05:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:51,723 INFO L480 AbstractCegarLoop]: Abstraction has 14550 states and 15489 transitions. [2018-11-06 21:05:51,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:51,723 INFO L276 IsEmpty]: Start isEmpty. Operand 14550 states and 15489 transitions. [2018-11-06 21:05:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-11-06 21:05:51,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:51,737 INFO L375 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-06 21:05:51,737 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:51,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:51,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1693902381, now seen corresponding path program 1 times [2018-11-06 21:05:51,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:51,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:51,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:51,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:51,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-11-06 21:05:52,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:52,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:05:52,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:05:52,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:05:52,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:05:52,274 INFO L87 Difference]: Start difference. First operand 14550 states and 15489 transitions. Second operand 5 states. [2018-11-06 21:05:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:54,656 INFO L93 Difference]: Finished difference Result 27991 states and 29842 transitions. [2018-11-06 21:05:54,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:05:54,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 566 [2018-11-06 21:05:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:54,667 INFO L225 Difference]: With dead ends: 27991 [2018-11-06 21:05:54,667 INFO L226 Difference]: Without dead ends: 15108 [2018-11-06 21:05:54,671 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:05:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15108 states. [2018-11-06 21:05:54,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15108 to 13809. [2018-11-06 21:05:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2018-11-06 21:05:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 14653 transitions. [2018-11-06 21:05:54,815 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 14653 transitions. Word has length 566 [2018-11-06 21:05:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:54,816 INFO L480 AbstractCegarLoop]: Abstraction has 13809 states and 14653 transitions. [2018-11-06 21:05:54,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:05:54,816 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 14653 transitions. [2018-11-06 21:05:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2018-11-06 21:05:54,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:54,827 INFO L375 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:54,828 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:54,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1644792320, now seen corresponding path program 1 times [2018-11-06 21:05:54,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:54,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:54,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:55,378 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-06 21:05:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 845 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2018-11-06 21:05:55,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:05:55,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:05:55,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:05:55,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:05:55,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:55,618 INFO L87 Difference]: Start difference. First operand 13809 states and 14653 transitions. Second operand 4 states. [2018-11-06 21:05:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:05:56,773 INFO L93 Difference]: Finished difference Result 26707 states and 28341 transitions. [2018-11-06 21:05:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:05:56,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 587 [2018-11-06 21:05:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:05:56,785 INFO L225 Difference]: With dead ends: 26707 [2018-11-06 21:05:56,785 INFO L226 Difference]: Without dead ends: 14565 [2018-11-06 21:05:56,791 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:05:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14565 states. [2018-11-06 21:05:56,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14565 to 13439. [2018-11-06 21:05:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13439 states. [2018-11-06 21:05:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13439 states to 13439 states and 14238 transitions. [2018-11-06 21:05:56,912 INFO L78 Accepts]: Start accepts. Automaton has 13439 states and 14238 transitions. Word has length 587 [2018-11-06 21:05:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:05:56,913 INFO L480 AbstractCegarLoop]: Abstraction has 13439 states and 14238 transitions. [2018-11-06 21:05:56,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:05:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 13439 states and 14238 transitions. [2018-11-06 21:05:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2018-11-06 21:05:56,922 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:05:56,923 INFO L375 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:05:56,923 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:05:56,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:05:56,924 INFO L82 PathProgramCache]: Analyzing trace with hash 623141152, now seen corresponding path program 1 times [2018-11-06 21:05:56,924 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:05:56,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:05:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:56,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:56,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:05:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:58,187 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-11-06 21:05:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 134 proven. 1073 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-06 21:05:58,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:05:58,942 INFO L225 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 [2018-11-06 21:05:58,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:05:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:05:59,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:06:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 434 proven. 773 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-06 21:06:00,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:06:00,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-06 21:06:00,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:06:00,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:06:00,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:06:00,845 INFO L87 Difference]: Start difference. First operand 13439 states and 14238 transitions. Second operand 12 states. [2018-11-06 21:06:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:07,949 INFO L93 Difference]: Finished difference Result 34308 states and 36289 transitions. [2018-11-06 21:06:07,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-06 21:06:07,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 722 [2018-11-06 21:06:07,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:07,969 INFO L225 Difference]: With dead ends: 34308 [2018-11-06 21:06:07,969 INFO L226 Difference]: Without dead ends: 22166 [2018-11-06 21:06:07,978 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 730 GetRequests, 717 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-06 21:06:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22166 states. [2018-11-06 21:06:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22166 to 14369. [2018-11-06 21:06:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14369 states. [2018-11-06 21:06:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14369 states to 14369 states and 15209 transitions. [2018-11-06 21:06:08,146 INFO L78 Accepts]: Start accepts. Automaton has 14369 states and 15209 transitions. Word has length 722 [2018-11-06 21:06:08,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:08,147 INFO L480 AbstractCegarLoop]: Abstraction has 14369 states and 15209 transitions. [2018-11-06 21:06:08,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:06:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 14369 states and 15209 transitions. [2018-11-06 21:06:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2018-11-06 21:06:08,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:08,162 INFO L375 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:06:08,163 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:08,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:08,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2135794138, now seen corresponding path program 1 times [2018-11-06 21:06:08,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:08,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:08,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:08,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:08,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:09,019 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-11-06 21:06:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 1514 proven. 116 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-06 21:06:09,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:06:09,451 INFO L225 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 [2018-11-06 21:06:09,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:09,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:06:10,399 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 25 [2018-11-06 21:06:12,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 1402 proven. 86 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2018-11-06 21:06:12,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:06:12,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-06 21:06:12,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:06:12,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:06:12,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:06:12,035 INFO L87 Difference]: Start difference. First operand 14369 states and 15209 transitions. Second operand 8 states. [2018-11-06 21:06:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:22,477 INFO L93 Difference]: Finished difference Result 38747 states and 41017 transitions. [2018-11-06 21:06:22,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-06 21:06:22,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 817 [2018-11-06 21:06:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:22,508 INFO L225 Difference]: With dead ends: 38747 [2018-11-06 21:06:22,508 INFO L226 Difference]: Without dead ends: 24937 [2018-11-06 21:06:22,515 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 838 GetRequests, 823 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:06:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24937 states. [2018-11-06 21:06:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24937 to 18087. [2018-11-06 21:06:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18087 states. [2018-11-06 21:06:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18087 states to 18087 states and 19125 transitions. [2018-11-06 21:06:22,721 INFO L78 Accepts]: Start accepts. Automaton has 18087 states and 19125 transitions. Word has length 817 [2018-11-06 21:06:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:22,722 INFO L480 AbstractCegarLoop]: Abstraction has 18087 states and 19125 transitions. [2018-11-06 21:06:22,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:06:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 18087 states and 19125 transitions. [2018-11-06 21:06:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 985 [2018-11-06 21:06:22,740 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:06:22,741 INFO L375 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, 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, 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, 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] [2018-11-06 21:06:22,742 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:06:22,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:06:22,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1332906654, now seen corresponding path program 2 times [2018-11-06 21:06:22,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:06:22,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:06:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:22,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:06:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:06:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:06:23,789 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 6 [2018-11-06 21:06:24,155 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-11-06 21:06:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1478 proven. 43 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2018-11-06 21:06:24,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:06:24,662 INFO L225 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 [2018-11-06 21:06:24,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-06 21:06:24,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-06 21:06:24,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-06 21:06:24,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:06:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2730 backedges. 1478 proven. 43 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2018-11-06 21:06:26,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:06:26,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-11-06 21:06:26,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:06:26,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:06:26,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:06:26,052 INFO L87 Difference]: Start difference. First operand 18087 states and 19125 transitions. Second operand 6 states. [2018-11-06 21:06:28,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:06:28,418 INFO L93 Difference]: Finished difference Result 38213 states and 40370 transitions. [2018-11-06 21:06:28,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:06:28,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 984 [2018-11-06 21:06:28,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:06:28,419 INFO L225 Difference]: With dead ends: 38213 [2018-11-06 21:06:28,419 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:06:28,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 983 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:06:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:06:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:06:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:06:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:06:28,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 984 [2018-11-06 21:06:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:06:28,432 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:06:28,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:06:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:06:28,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:06:28,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:06:28,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:28,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:28,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:29,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:29,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:29,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:30,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:30,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:30,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:31,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:31,555 WARN L179 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 943 DAG size of output: 837 [2018-11-06 21:06:31,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:31,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:31,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:32,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:32,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:32,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:32,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:32,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:33,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:33,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:06:33,717 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 943 DAG size of output: 837 [2018-11-06 21:06:45,331 WARN L179 SmtUtils]: Spent 11.61 s on a formula simplification. DAG size of input: 820 DAG size of output: 152 [2018-11-06 21:06:56,259 WARN L179 SmtUtils]: Spent 10.92 s on a formula simplification. DAG size of input: 820 DAG size of output: 152 [2018-11-06 21:06:56,263 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L428 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-06 21:06:56,264 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L173(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-06 21:06:56,265 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-06 21:06:56,266 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,266 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-11-06 21:06:56,266 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse9 (= ~a25~0 13))) (let ((.cse23 (not .cse9)) (.cse24 (<= ~a29~0 140)) (.cse10 (< 306 ~a23~0)) (.cse18 (<= 141 ~a29~0)) (.cse15 (= ~a25~0 10)) (.cse11 (= ~a4~0 1)) (.cse28 (< 277 ~a29~0))) (let ((.cse1 (or (and .cse9 .cse11) .cse28)) (.cse7 (<= 0 (+ ~a23~0 119992))) (.cse17 (or .cse9 .cse28)) (.cse16 (and .cse10 .cse18 .cse15)) (.cse22 (< 245 ~a29~0)) (.cse19 (<= ~a29~0 277)) (.cse3 (<= ~a4~0 0)) (.cse25 (<= ~a23~0 312)) (.cse6 (= ~a25~0 11)) (.cse20 (<= ~a29~0 245)) (.cse0 (= ~a25~0 9)) (.cse2 (<= ~a23~0 138)) (.cse5 (and .cse23 .cse24)) (.cse8 (<= ~a23~0 599997)) (.cse4 (= ~a25~0 12)) (.cse12 (= 1 ~a3~0)) (.cse13 (= 15 ~a8~0)) (.cse14 (= 1 ~a4~0))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse4 .cse3 .cse5) (and .cse3 .cse2 .cse6 .cse7) (and .cse8 (and .cse9 .cse10 .cse11)) (and .cse8 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse9 .cse2 .cse14 .cse7) (and .cse3 .cse1 (<= (+ ~a23~0 115606) 0) .cse6) (and .cse9 .cse12 (<= ~a23~0 408677) .cse13 .cse14 .cse7) (and .cse3 .cse2 .cse15 .cse7) (and (and .cse2 .cse15) .cse11) (and .cse9 .cse3 .cse2 .cse7) (and .cse12 .cse16 .cse13 .cse17 .cse14) (and .cse12 .cse13 .cse17 .cse14 .cse6) (and (and .cse2 .cse18) .cse11 .cse19) (and .cse8 (and (and .cse11 .cse16) .cse20)) (and .cse8 (and (and (and .cse10 .cse18) .cse12 .cse13 .cse14) .cse20)) (and (exists ((v_prenex_162 Int)) (let ((.cse21 (mod v_prenex_162 299846))) (and (<= (+ v_prenex_162 43) 0) (= .cse21 0) (<= ~a23~0 (+ .cse21 364244))))) (and (and .cse11 (and .cse18 .cse15)) .cse20)) (and .cse0 .cse12 .cse13 .cse22 .cse14) (and (<= ~a23~0 300151) .cse11 .cse19 .cse22 .cse15) (and .cse12 (and (and .cse10 .cse23 .cse22) .cse19) .cse13 .cse14) (and .cse4 .cse3 .cse2) (and (and .cse3 (and .cse15 .cse24)) .cse2) (and .cse0 .cse11 .cse2) (and (<= (+ ~a23~0 112765) 0) .cse11 .cse18) (and .cse3 .cse2 .cse5 .cse6) (and (and .cse2 .cse22) .cse9 .cse3 .cse19) (and .cse4 .cse25 .cse12 .cse13 .cse14) (and .cse0 .cse11 .cse5) (or (and .cse9 (and (and .cse25 .cse18) (exists ((v_prenex_98 Int)) (let ((.cse26 (mod v_prenex_98 52))) (let ((.cse27 (+ .cse26 192))) (and (< 140 v_prenex_98) (<= 0 (+ .cse26 140)) (<= ~a29~0 (+ (div .cse27 5) 183)) (<= 0 v_prenex_98) (< 277 v_prenex_98) (<= 0 .cse27))))) .cse14)) (and .cse9 .cse12 .cse18 .cse13 .cse20 .cse14)) (and .cse3 (and .cse0 .cse2 .cse5)) (and .cse25 .cse12 .cse13 .cse14 .cse6) (and .cse8 (and .cse20 (and .cse0 .cse11))) (and .cse11 .cse2 .cse5) (and .cse8 .cse4 .cse12 .cse13 (<= ~a29~0 220) .cse14))))) [2018-11-06 21:06:56,266 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,266 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,266 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,266 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,266 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,267 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,267 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,267 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,268 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-06 21:06:56,268 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-06 21:06:56,268 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-06 21:06:56,268 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:06:56,268 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:06:56,268 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:06:56,268 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:06:56,268 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,268 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,269 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,269 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,269 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,269 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,269 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,269 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,269 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,269 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,269 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-06 21:06:56,269 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-06 21:06:56,270 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-06 21:06:56,270 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-11-06 21:06:56,270 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,270 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,270 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,270 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,270 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,270 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-06 21:06:56,270 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-06 21:06:56,270 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-06 21:06:56,271 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,271 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,271 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,271 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,271 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:06:56,271 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:06:56,271 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,271 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,271 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,271 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,272 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:06:56,273 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:06:56,274 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:06:56,274 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,274 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,274 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:06:56,274 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:06:56,274 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:06:56,274 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,274 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,274 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,274 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,275 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,275 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-11-06 21:06:56,275 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-06 21:06:56,275 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-06 21:06:56,275 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,275 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,275 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,275 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,275 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,275 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,276 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-06 21:06:56,276 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-06 21:06:56,276 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-11-06 21:06:56,276 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,276 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,276 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,276 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,276 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,276 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,276 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,277 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:06:56,277 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,277 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-11-06 21:06:56,277 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-06 21:06:56,277 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-06 21:06:56,277 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,277 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,277 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,277 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,277 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-06 21:06:56,278 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-06 21:06:56,279 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,279 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,279 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,279 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,279 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,279 INFO L425 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,279 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,279 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-11-06 21:06:56,279 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-06 21:06:56,279 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,280 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,281 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-06 21:06:56,281 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-06 21:06:56,281 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,281 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,281 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:06:56,281 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:06:56,281 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,281 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,281 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,283 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,284 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-06 21:06:56,285 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-06 21:06:56,285 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:06:56,285 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,285 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,285 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,285 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,285 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,285 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,285 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-06 21:06:56,285 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,286 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,287 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-06 21:06:56,287 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-06 21:06:56,287 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-06 21:06:56,287 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,287 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:06:56,287 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,287 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:06:56,287 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,288 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,288 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,288 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,288 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,288 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,288 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-06 21:06:56,288 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-06 21:06:56,288 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-06 21:06:56,288 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,288 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,289 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,289 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:06:56,289 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,289 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,289 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,289 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,289 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,289 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,289 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,290 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-06 21:06:56,293 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-06 21:06:56,293 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-06 21:06:56,293 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,293 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:06:56,293 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:06:56,293 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,293 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,293 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,293 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,294 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,294 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,294 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-06 21:06:56,294 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-06 21:06:56,294 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-06 21:06:56,294 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,294 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,294 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,295 INFO L421 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse9 (= ~a25~0 13))) (let ((.cse23 (not .cse9)) (.cse24 (<= ~a29~0 140)) (.cse10 (< 306 ~a23~0)) (.cse18 (<= 141 ~a29~0)) (.cse15 (= ~a25~0 10)) (.cse11 (= ~a4~0 1)) (.cse28 (< 277 ~a29~0))) (let ((.cse1 (or (and .cse9 .cse11) .cse28)) (.cse7 (<= 0 (+ ~a23~0 119992))) (.cse17 (or .cse9 .cse28)) (.cse16 (and .cse10 .cse18 .cse15)) (.cse22 (< 245 ~a29~0)) (.cse19 (<= ~a29~0 277)) (.cse3 (<= ~a4~0 0)) (.cse25 (<= ~a23~0 312)) (.cse6 (= ~a25~0 11)) (.cse20 (<= ~a29~0 245)) (.cse0 (= ~a25~0 9)) (.cse2 (<= ~a23~0 138)) (.cse5 (and .cse23 .cse24)) (.cse8 (<= ~a23~0 599997)) (.cse4 (= ~a25~0 12)) (.cse12 (= 1 ~a3~0)) (.cse13 (= 15 ~a8~0)) (.cse14 (= 1 ~a4~0))) (or (and (and .cse0 .cse1 .cse2) .cse3) (and .cse4 .cse3 .cse5) (and .cse3 .cse2 .cse6 .cse7) (and .cse8 (and .cse9 .cse10 .cse11)) (and .cse8 .cse10 .cse12 .cse13 .cse14 .cse15) (and .cse9 .cse2 .cse14 .cse7) (and .cse3 .cse1 (<= (+ ~a23~0 115606) 0) .cse6) (and .cse9 .cse12 (<= ~a23~0 408677) .cse13 .cse14 .cse7) (and .cse3 .cse2 .cse15 .cse7) (and (and .cse2 .cse15) .cse11) (and .cse9 .cse3 .cse2 .cse7) (and .cse12 .cse16 .cse13 .cse17 .cse14) (and .cse12 .cse13 .cse17 .cse14 .cse6) (and (and .cse2 .cse18) .cse11 .cse19) (and .cse8 (and (and .cse11 .cse16) .cse20)) (and .cse8 (and (and (and .cse10 .cse18) .cse12 .cse13 .cse14) .cse20)) (and (exists ((v_prenex_162 Int)) (let ((.cse21 (mod v_prenex_162 299846))) (and (<= (+ v_prenex_162 43) 0) (= .cse21 0) (<= ~a23~0 (+ .cse21 364244))))) (and (and .cse11 (and .cse18 .cse15)) .cse20)) (and .cse0 .cse12 .cse13 .cse22 .cse14) (and (<= ~a23~0 300151) .cse11 .cse19 .cse22 .cse15) (and .cse12 (and (and .cse10 .cse23 .cse22) .cse19) .cse13 .cse14) (and .cse4 .cse3 .cse2) (and (and .cse3 (and .cse15 .cse24)) .cse2) (and .cse0 .cse11 .cse2) (and (<= (+ ~a23~0 112765) 0) .cse11 .cse18) (and .cse3 .cse2 .cse5 .cse6) (and (and .cse2 .cse22) .cse9 .cse3 .cse19) (and .cse4 .cse25 .cse12 .cse13 .cse14) (and .cse0 .cse11 .cse5) (or (and .cse9 (and (and .cse25 .cse18) (exists ((v_prenex_98 Int)) (let ((.cse26 (mod v_prenex_98 52))) (let ((.cse27 (+ .cse26 192))) (and (< 140 v_prenex_98) (<= 0 (+ .cse26 140)) (<= ~a29~0 (+ (div .cse27 5) 183)) (<= 0 v_prenex_98) (< 277 v_prenex_98) (<= 0 .cse27))))) .cse14)) (and .cse9 .cse12 .cse18 .cse13 .cse20 .cse14)) (and .cse3 (and .cse0 .cse2 .cse5)) (and .cse25 .cse12 .cse13 .cse14 .cse6) (and .cse8 (and .cse20 (and .cse0 .cse11))) (and .cse11 .cse2 .cse5) (and .cse8 .cse4 .cse12 .cse13 (<= ~a29~0 220) .cse14))))) [2018-11-06 21:06:56,295 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,295 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:06:56,295 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:06:56,295 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,295 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,295 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-11-06 21:06:56,296 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,297 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,297 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:06:56,326 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,327 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,331 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,331 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,331 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,332 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,332 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,332 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,353 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,358 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,359 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,360 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,369 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,370 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,370 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,373 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,373 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,374 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,374 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,374 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,374 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,379 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,380 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,383 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,384 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:06:56 BoogieIcfgContainer [2018-11-06 21:06:56,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:06:56,391 INFO L168 Benchmark]: Toolchain (without parser) took 150791.11 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-11-06 21:06:56,397 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:06:56,398 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1004.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:56,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 283.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -843.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:56,399 INFO L168 Benchmark]: Boogie Preprocessor took 121.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:56,400 INFO L168 Benchmark]: RCFGBuilder took 4977.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 188.1 MB). Peak memory consumption was 188.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:06:56,404 INFO L168 Benchmark]: TraceAbstraction took 144399.17 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.7 GB in the end (delta: -726.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-06 21:06:56,410 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1004.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 63.4 MB). Peak memory consumption was 63.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 283.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 751.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -843.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 121.07 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4977.23 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 188.1 MB). Peak memory consumption was 188.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144399.17 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.7 GB in the end (delta: -726.4 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 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_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 138]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-11-06 21:06:56,432 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,432 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,432 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,432 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,433 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,433 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,433 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,433 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,434 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,438 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,440 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,441 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a25 == 9 && ((a25 == 13 && a4 == 1) || 277 < a29)) && a23 <= 138) && a4 <= 0) || ((a25 == 12 && a4 <= 0) && !(a25 == 13) && a29 <= 140)) || (((a4 <= 0 && a23 <= 138) && a25 == 11) && 0 <= a23 + 119992)) || (a23 <= 599997 && (a25 == 13 && 306 < a23) && a4 == 1)) || (((((a23 <= 599997 && 306 < a23) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 10)) || (((a25 == 13 && a23 <= 138) && 1 == a4) && 0 <= a23 + 119992)) || (((a4 <= 0 && ((a25 == 13 && a4 == 1) || 277 < a29)) && a23 + 115606 <= 0) && a25 == 11)) || (((((a25 == 13 && 1 == a3) && a23 <= 408677) && 15 == a8) && 1 == a4) && 0 <= a23 + 119992)) || (((a4 <= 0 && a23 <= 138) && a25 == 10) && 0 <= a23 + 119992)) || ((a23 <= 138 && a25 == 10) && a4 == 1)) || (((a25 == 13 && a4 <= 0) && a23 <= 138) && 0 <= a23 + 119992)) || ((((1 == a3 && (306 < a23 && 141 <= a29) && a25 == 10) && 15 == a8) && (a25 == 13 || 277 < a29)) && 1 == a4)) || ((((1 == a3 && 15 == a8) && (a25 == 13 || 277 < a29)) && 1 == a4) && a25 == 11)) || (((a23 <= 138 && 141 <= a29) && a4 == 1) && a29 <= 277)) || (a23 <= 599997 && (a4 == 1 && (306 < a23 && 141 <= a29) && a25 == 10) && a29 <= 245)) || (a23 <= 599997 && ((((306 < a23 && 141 <= a29) && 1 == a3) && 15 == a8) && 1 == a4) && a29 <= 245)) || ((\exists v_prenex_162 : int :: (v_prenex_162 + 43 <= 0 && v_prenex_162 % 299846 == 0) && a23 <= v_prenex_162 % 299846 + 364244) && (a4 == 1 && 141 <= a29 && a25 == 10) && a29 <= 245)) || ((((a25 == 9 && 1 == a3) && 15 == a8) && 245 < a29) && 1 == a4)) || ((((a23 <= 300151 && a4 == 1) && a29 <= 277) && 245 < a29) && a25 == 10)) || (((1 == a3 && ((306 < a23 && !(a25 == 13)) && 245 < a29) && a29 <= 277) && 15 == a8) && 1 == a4)) || ((a25 == 12 && a4 <= 0) && a23 <= 138)) || ((a4 <= 0 && a25 == 10 && a29 <= 140) && a23 <= 138)) || ((a25 == 9 && a4 == 1) && a23 <= 138)) || ((a23 + 112765 <= 0 && a4 == 1) && 141 <= a29)) || (((a4 <= 0 && a23 <= 138) && !(a25 == 13) && a29 <= 140) && a25 == 11)) || ((((a23 <= 138 && 245 < a29) && a25 == 13) && a4 <= 0) && a29 <= 277)) || ((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4)) || ((a25 == 9 && a4 == 1) && !(a25 == 13) && a29 <= 140)) || (a25 == 13 && ((a23 <= 312 && 141 <= a29) && (\exists v_prenex_98 : int :: ((((140 < v_prenex_98 && 0 <= v_prenex_98 % 52 + 140) && a29 <= (v_prenex_98 % 52 + 192) / 5 + 183) && 0 <= v_prenex_98) && 277 < v_prenex_98) && 0 <= v_prenex_98 % 52 + 192)) && 1 == a4) || (((((a25 == 13 && 1 == a3) && 141 <= a29) && 15 == a8) && a29 <= 245) && 1 == a4)) || (a4 <= 0 && (a25 == 9 && a23 <= 138) && !(a25 == 13) && a29 <= 140)) || ((((a23 <= 312 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || (a23 <= 599997 && a29 <= 245 && a25 == 9 && a4 == 1)) || ((a4 == 1 && a23 <= 138) && !(a25 == 13) && a29 <= 140)) || (((((a23 <= 599997 && a25 == 12) && 1 == a3) && 15 == a8) && a29 <= 220) && 1 == a4) - InvariantResult [Line: 22]: Loop Invariant [2018-11-06 21:06:56,442 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,443 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,444 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,446 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_162,QUANTIFIED] [2018-11-06 21:06:56,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,447 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] [2018-11-06 21:06:56,448 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_98,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((a25 == 9 && ((a25 == 13 && a4 == 1) || 277 < a29)) && a23 <= 138) && a4 <= 0) || ((a25 == 12 && a4 <= 0) && !(a25 == 13) && a29 <= 140)) || (((a4 <= 0 && a23 <= 138) && a25 == 11) && 0 <= a23 + 119992)) || (a23 <= 599997 && (a25 == 13 && 306 < a23) && a4 == 1)) || (((((a23 <= 599997 && 306 < a23) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 10)) || (((a25 == 13 && a23 <= 138) && 1 == a4) && 0 <= a23 + 119992)) || (((a4 <= 0 && ((a25 == 13 && a4 == 1) || 277 < a29)) && a23 + 115606 <= 0) && a25 == 11)) || (((((a25 == 13 && 1 == a3) && a23 <= 408677) && 15 == a8) && 1 == a4) && 0 <= a23 + 119992)) || (((a4 <= 0 && a23 <= 138) && a25 == 10) && 0 <= a23 + 119992)) || ((a23 <= 138 && a25 == 10) && a4 == 1)) || (((a25 == 13 && a4 <= 0) && a23 <= 138) && 0 <= a23 + 119992)) || ((((1 == a3 && (306 < a23 && 141 <= a29) && a25 == 10) && 15 == a8) && (a25 == 13 || 277 < a29)) && 1 == a4)) || ((((1 == a3 && 15 == a8) && (a25 == 13 || 277 < a29)) && 1 == a4) && a25 == 11)) || (((a23 <= 138 && 141 <= a29) && a4 == 1) && a29 <= 277)) || (a23 <= 599997 && (a4 == 1 && (306 < a23 && 141 <= a29) && a25 == 10) && a29 <= 245)) || (a23 <= 599997 && ((((306 < a23 && 141 <= a29) && 1 == a3) && 15 == a8) && 1 == a4) && a29 <= 245)) || ((\exists v_prenex_162 : int :: (v_prenex_162 + 43 <= 0 && v_prenex_162 % 299846 == 0) && a23 <= v_prenex_162 % 299846 + 364244) && (a4 == 1 && 141 <= a29 && a25 == 10) && a29 <= 245)) || ((((a25 == 9 && 1 == a3) && 15 == a8) && 245 < a29) && 1 == a4)) || ((((a23 <= 300151 && a4 == 1) && a29 <= 277) && 245 < a29) && a25 == 10)) || (((1 == a3 && ((306 < a23 && !(a25 == 13)) && 245 < a29) && a29 <= 277) && 15 == a8) && 1 == a4)) || ((a25 == 12 && a4 <= 0) && a23 <= 138)) || ((a4 <= 0 && a25 == 10 && a29 <= 140) && a23 <= 138)) || ((a25 == 9 && a4 == 1) && a23 <= 138)) || ((a23 + 112765 <= 0 && a4 == 1) && 141 <= a29)) || (((a4 <= 0 && a23 <= 138) && !(a25 == 13) && a29 <= 140) && a25 == 11)) || ((((a23 <= 138 && 245 < a29) && a25 == 13) && a4 <= 0) && a29 <= 277)) || ((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4)) || ((a25 == 9 && a4 == 1) && !(a25 == 13) && a29 <= 140)) || (a25 == 13 && ((a23 <= 312 && 141 <= a29) && (\exists v_prenex_98 : int :: ((((140 < v_prenex_98 && 0 <= v_prenex_98 % 52 + 140) && a29 <= (v_prenex_98 % 52 + 192) / 5 + 183) && 0 <= v_prenex_98) && 277 < v_prenex_98) && 0 <= v_prenex_98 % 52 + 192)) && 1 == a4) || (((((a25 == 13 && 1 == a3) && 141 <= a29) && 15 == a8) && a29 <= 245) && 1 == a4)) || (a4 <= 0 && (a25 == 9 && a23 <= 138) && !(a25 == 13) && a29 <= 140)) || ((((a23 <= 312 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || (a23 <= 599997 && a29 <= 245 && a25 == 9 && a4 == 1)) || ((a4 == 1 && a23 <= 138) && !(a25 == 13) && a29 <= 140)) || (((((a23 <= 599997 && a25 == 12) && 1 == a3) && 15 == a8) && a29 <= 220) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 144.2s OverallTime, 18 OverallIterations, 8 TraceHistogramMax, 85.5s AutomataDifference, 0.0s DeadEndRemovalTime, 27.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 3929 SDtfs, 17570 SDslu, 3380 SDs, 0 SdLazy, 52603 SolverSat, 5958 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 69.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4275 GetRequests, 4141 SyntacticMatches, 13 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 12.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21190occurred in iteration=10, 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: 2.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 47814 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 382 NumberOfFragments, 1309 HoareAnnotationTreeSize, 3 FomulaSimplifications, 255824 FormulaSimplificationTreeSizeReduction, 5.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 426266 FormulaSimplificationTreeSizeReductionInter, 22.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 11871 NumberOfCodeBlocks, 11871 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 11846 ConstructedInterpolants, 932 QuantifiedInterpolants, 37475056 SizeOfPredicates, 10 NumberOfNonLiveVariables, 5268 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 25 InterpolantComputations, 11 PerfectInterpolantSequences, 17149/21235 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...