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/Problem01_label51_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 19:50:27,813 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 19:50:27,815 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 19:50:27,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 19:50:27,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 19:50:27,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 19:50:27,835 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 19:50:27,837 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 19:50:27,840 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 19:50:27,841 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 19:50:27,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 19:50:27,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 19:50:27,845 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 19:50:27,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 19:50:27,847 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 19:50:27,856 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 19:50:27,857 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 19:50:27,860 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 19:50:27,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 19:50:27,867 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 19:50:27,868 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 19:50:27,871 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 19:50:27,875 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 19:50:27,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 19:50:27,875 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 19:50:27,876 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 19:50:27,877 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 19:50:27,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 19:50:27,880 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 19:50:27,881 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 19:50:27,881 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 19:50:27,882 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 19:50:27,882 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 19:50:27,882 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 19:50:27,885 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 19:50:27,886 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 19:50:27,886 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 19:50:27,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 19:50:27,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 19:50:27,910 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 19:50:27,911 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 19:50:27,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 19:50:27,911 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 19:50:27,912 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 19:50:27,912 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 19:50:27,912 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 19:50:27,912 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 19:50:27,913 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 19:50:27,913 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 19:50:27,913 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 19:50:27,913 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 19:50:27,913 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 19:50:27,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 19:50:27,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 19:50:27,914 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 19:50:27,914 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 19:50:27,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 19:50:27,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 19:50:27,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 19:50:27,915 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 19:50:27,915 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 19:50:27,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 19:50:27,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 19:50:27,916 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 19:50:27,916 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 19:50:27,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 19:50:28,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 19:50:28,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 19:50:28,009 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 19:50:28,010 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 19:50:28,010 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label51_true-unreach-call_false-termination.c [2018-11-06 19:50:28,086 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664a9dae9/0fccd6350a114561bcdaa6d9fa65a707/FLAG4e82e7b95 [2018-11-06 19:50:28,690 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 19:50:28,693 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label51_true-unreach-call_false-termination.c [2018-11-06 19:50:28,704 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664a9dae9/0fccd6350a114561bcdaa6d9fa65a707/FLAG4e82e7b95 [2018-11-06 19:50:28,719 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664a9dae9/0fccd6350a114561bcdaa6d9fa65a707 [2018-11-06 19:50:28,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 19:50:28,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 19:50:28,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 19:50:28,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 19:50:28,737 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 19:50:28,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:50:28" (1/1) ... [2018-11-06 19:50:28,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394dbc7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:28, skipping insertion in model container [2018-11-06 19:50:28,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:50:28" (1/1) ... [2018-11-06 19:50:28,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 19:50:28,808 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 19:50:29,389 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:50:29,393 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 19:50:29,488 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 19:50:29,507 INFO L193 MainTranslator]: Completed translation [2018-11-06 19:50:29,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29 WrapperNode [2018-11-06 19:50:29,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 19:50:29,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 19:50:29,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 19:50:29,509 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 19:50:29,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (1/1) ... [2018-11-06 19:50:29,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (1/1) ... [2018-11-06 19:50:29,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 19:50:29,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 19:50:29,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 19:50:29,716 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 19:50:29,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (1/1) ... [2018-11-06 19:50:29,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (1/1) ... [2018-11-06 19:50:29,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (1/1) ... [2018-11-06 19:50:29,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (1/1) ... [2018-11-06 19:50:29,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (1/1) ... [2018-11-06 19:50:29,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (1/1) ... [2018-11-06 19:50:29,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (1/1) ... [2018-11-06 19:50:29,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 19:50:29,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 19:50:29,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 19:50:29,816 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 19:50:29,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (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 19:50:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 19:50:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 19:50:29,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 19:50:32,984 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 19:50:32,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:50:32 BoogieIcfgContainer [2018-11-06 19:50:32,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 19:50:32,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 19:50:32,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 19:50:32,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 19:50:32,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:50:28" (1/3) ... [2018-11-06 19:50:32,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646a4506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:50:32, skipping insertion in model container [2018-11-06 19:50:32,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:50:29" (2/3) ... [2018-11-06 19:50:32,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646a4506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:50:32, skipping insertion in model container [2018-11-06 19:50:32,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:50:32" (3/3) ... [2018-11-06 19:50:32,996 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label51_true-unreach-call_false-termination.c [2018-11-06 19:50:33,007 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 19:50:33,019 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 19:50:33,038 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 19:50:33,085 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 19:50:33,086 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 19:50:33,087 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 19:50:33,087 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 19:50:33,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 19:50:33,088 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 19:50:33,088 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 19:50:33,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 19:50:33,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 19:50:33,121 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-11-06 19:50:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-06 19:50:33,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:33,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:33,148 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:33,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash 558269655, now seen corresponding path program 1 times [2018-11-06 19:50:33,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:33,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:33,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:33,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:33,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:33,685 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 19:50:33,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:33,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:50:33,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:33,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:33,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:33,718 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 3 states. [2018-11-06 19:50:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:35,234 INFO L93 Difference]: Finished difference Result 531 states and 918 transitions. [2018-11-06 19:50:35,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:35,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-11-06 19:50:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:35,255 INFO L225 Difference]: With dead ends: 531 [2018-11-06 19:50:35,256 INFO L226 Difference]: Without dead ends: 328 [2018-11-06 19:50:35,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-06 19:50:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-11-06 19:50:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-06 19:50:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 533 transitions. [2018-11-06 19:50:35,330 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 533 transitions. Word has length 107 [2018-11-06 19:50:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:35,331 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 533 transitions. [2018-11-06 19:50:35,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 533 transitions. [2018-11-06 19:50:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-06 19:50:35,337 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:35,337 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:35,338 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:35,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2470338, now seen corresponding path program 1 times [2018-11-06 19:50:35,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:35,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:35,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:35,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:35,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:35,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:35,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:35,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:35,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:35,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:35,465 INFO L87 Difference]: Start difference. First operand 328 states and 533 transitions. Second operand 4 states. [2018-11-06 19:50:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:37,049 INFO L93 Difference]: Finished difference Result 918 states and 1534 transitions. [2018-11-06 19:50:37,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:37,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-11-06 19:50:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:37,056 INFO L225 Difference]: With dead ends: 918 [2018-11-06 19:50:37,056 INFO L226 Difference]: Without dead ends: 592 [2018-11-06 19:50:37,059 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 19:50:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-11-06 19:50:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2018-11-06 19:50:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-06 19:50:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 895 transitions. [2018-11-06 19:50:37,093 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 895 transitions. Word has length 113 [2018-11-06 19:50:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:37,094 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 895 transitions. [2018-11-06 19:50:37,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 895 transitions. [2018-11-06 19:50:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-06 19:50:37,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:37,100 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:37,100 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:37,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:37,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1772789842, now seen corresponding path program 1 times [2018-11-06 19:50:37,101 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:37,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:37,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:37,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:37,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:37,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:37,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 19:50:37,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:37,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:37,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:37,208 INFO L87 Difference]: Start difference. First operand 592 states and 895 transitions. Second operand 3 states. [2018-11-06 19:50:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:38,080 INFO L93 Difference]: Finished difference Result 1314 states and 1999 transitions. [2018-11-06 19:50:38,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:38,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-06 19:50:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:38,089 INFO L225 Difference]: With dead ends: 1314 [2018-11-06 19:50:38,089 INFO L226 Difference]: Without dead ends: 724 [2018-11-06 19:50:38,091 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-11-06 19:50:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2018-11-06 19:50:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-06 19:50:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1076 transitions. [2018-11-06 19:50:38,123 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1076 transitions. Word has length 121 [2018-11-06 19:50:38,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:38,123 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 1076 transitions. [2018-11-06 19:50:38,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1076 transitions. [2018-11-06 19:50:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-06 19:50:38,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:38,128 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:38,128 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:38,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash -53792509, now seen corresponding path program 1 times [2018-11-06 19:50:38,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:38,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:38,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:50:38,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:38,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:38,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:38,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:38,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:38,416 INFO L87 Difference]: Start difference. First operand 724 states and 1076 transitions. Second operand 4 states. [2018-11-06 19:50:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:42,002 INFO L93 Difference]: Finished difference Result 2634 states and 3965 transitions. [2018-11-06 19:50:42,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:50:42,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-11-06 19:50:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:42,012 INFO L225 Difference]: With dead ends: 2634 [2018-11-06 19:50:42,012 INFO L226 Difference]: Without dead ends: 1912 [2018-11-06 19:50:42,014 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 19:50:42,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2018-11-06 19:50:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1912. [2018-11-06 19:50:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2018-11-06 19:50:42,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2634 transitions. [2018-11-06 19:50:42,052 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2634 transitions. Word has length 131 [2018-11-06 19:50:42,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:42,053 INFO L480 AbstractCegarLoop]: Abstraction has 1912 states and 2634 transitions. [2018-11-06 19:50:42,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:42,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2634 transitions. [2018-11-06 19:50:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-06 19:50:42,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:42,057 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 19:50:42,058 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:42,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:42,058 INFO L82 PathProgramCache]: Analyzing trace with hash 154110546, now seen corresponding path program 1 times [2018-11-06 19:50:42,058 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:42,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:42,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:42,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:42,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:50:42,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:42,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:42,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:42,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:42,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:42,227 INFO L87 Difference]: Start difference. First operand 1912 states and 2634 transitions. Second operand 4 states. [2018-11-06 19:50:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:43,285 INFO L93 Difference]: Finished difference Result 4141 states and 5654 transitions. [2018-11-06 19:50:43,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:50:43,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-11-06 19:50:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:43,297 INFO L225 Difference]: With dead ends: 4141 [2018-11-06 19:50:43,298 INFO L226 Difference]: Without dead ends: 2231 [2018-11-06 19:50:43,301 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:50:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2018-11-06 19:50:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2171. [2018-11-06 19:50:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2018-11-06 19:50:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2921 transitions. [2018-11-06 19:50:43,352 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2921 transitions. Word has length 137 [2018-11-06 19:50:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:43,352 INFO L480 AbstractCegarLoop]: Abstraction has 2171 states and 2921 transitions. [2018-11-06 19:50:43,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2921 transitions. [2018-11-06 19:50:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-06 19:50:43,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:43,358 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:43,359 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:43,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:43,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1112001030, now seen corresponding path program 1 times [2018-11-06 19:50:43,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:43,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:43,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:43,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:43,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:50:43,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:43,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:43,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:43,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:43,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:43,613 INFO L87 Difference]: Start difference. First operand 2171 states and 2921 transitions. Second operand 4 states. [2018-11-06 19:50:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:45,300 INFO L93 Difference]: Finished difference Result 4340 states and 5840 transitions. [2018-11-06 19:50:45,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:50:45,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2018-11-06 19:50:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:45,313 INFO L225 Difference]: With dead ends: 4340 [2018-11-06 19:50:45,313 INFO L226 Difference]: Without dead ends: 2171 [2018-11-06 19:50:45,317 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 19:50:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2018-11-06 19:50:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 2171. [2018-11-06 19:50:45,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2018-11-06 19:50:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2897 transitions. [2018-11-06 19:50:45,354 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2897 transitions. Word has length 142 [2018-11-06 19:50:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:45,355 INFO L480 AbstractCegarLoop]: Abstraction has 2171 states and 2897 transitions. [2018-11-06 19:50:45,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:45,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2897 transitions. [2018-11-06 19:50:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-06 19:50:45,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:45,360 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:45,360 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:45,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:45,361 INFO L82 PathProgramCache]: Analyzing trace with hash -337482434, now seen corresponding path program 1 times [2018-11-06 19:50:45,361 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:45,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:45,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:45,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:45,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-06 19:50:45,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:45,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 19:50:45,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 19:50:45,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 19:50:45,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 19:50:45,459 INFO L87 Difference]: Start difference. First operand 2171 states and 2897 transitions. Second operand 3 states. [2018-11-06 19:50:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:46,130 INFO L93 Difference]: Finished difference Result 5911 states and 7850 transitions. [2018-11-06 19:50:46,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 19:50:46,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2018-11-06 19:50:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:46,142 INFO L225 Difference]: With dead ends: 5911 [2018-11-06 19:50:46,143 INFO L226 Difference]: Without dead ends: 2548 [2018-11-06 19:50:46,147 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 19:50:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2018-11-06 19:50:46,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2548. [2018-11-06 19:50:46,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2018-11-06 19:50:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 2960 transitions. [2018-11-06 19:50:46,190 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 2960 transitions. Word has length 145 [2018-11-06 19:50:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:46,190 INFO L480 AbstractCegarLoop]: Abstraction has 2548 states and 2960 transitions. [2018-11-06 19:50:46,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 19:50:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 2960 transitions. [2018-11-06 19:50:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-06 19:50:46,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:46,196 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:46,196 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:46,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:46,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1878812105, now seen corresponding path program 1 times [2018-11-06 19:50:46,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:46,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:46,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:46,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:46,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:46,479 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 19:50:46,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:46,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:50:46,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 19:50:46,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 19:50:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 19:50:46,480 INFO L87 Difference]: Start difference. First operand 2548 states and 2960 transitions. Second operand 5 states. [2018-11-06 19:50:49,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:49,847 INFO L93 Difference]: Finished difference Result 7609 states and 8959 transitions. [2018-11-06 19:50:49,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 19:50:49,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2018-11-06 19:50:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:49,867 INFO L225 Difference]: With dead ends: 7609 [2018-11-06 19:50:49,867 INFO L226 Difference]: Without dead ends: 4663 [2018-11-06 19:50:49,871 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 19:50:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2018-11-06 19:50:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 3730. [2018-11-06 19:50:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3730 states. [2018-11-06 19:50:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3730 states to 3730 states and 4199 transitions. [2018-11-06 19:50:49,935 INFO L78 Accepts]: Start accepts. Automaton has 3730 states and 4199 transitions. Word has length 159 [2018-11-06 19:50:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:49,935 INFO L480 AbstractCegarLoop]: Abstraction has 3730 states and 4199 transitions. [2018-11-06 19:50:49,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 19:50:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3730 states and 4199 transitions. [2018-11-06 19:50:49,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-06 19:50:49,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:49,942 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:50:49,942 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:49,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:49,943 INFO L82 PathProgramCache]: Analyzing trace with hash 242524652, now seen corresponding path program 1 times [2018-11-06 19:50:49,943 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:49,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:49,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:49,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:49,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:50,400 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 19:50:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-06 19:50:50,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 19:50:50,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 19:50:50,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 19:50:50,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 19:50:50,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 19:50:50,425 INFO L87 Difference]: Start difference. First operand 3730 states and 4199 transitions. Second operand 4 states. [2018-11-06 19:50:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:51,400 INFO L93 Difference]: Finished difference Result 7859 states and 8918 transitions. [2018-11-06 19:50:51,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 19:50:51,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-11-06 19:50:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:51,412 INFO L225 Difference]: With dead ends: 7859 [2018-11-06 19:50:51,412 INFO L226 Difference]: Without dead ends: 3997 [2018-11-06 19:50:51,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 19:50:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2018-11-06 19:50:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 3997. [2018-11-06 19:50:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3997 states. [2018-11-06 19:50:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 4345 transitions. [2018-11-06 19:50:51,478 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 4345 transitions. Word has length 189 [2018-11-06 19:50:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:51,479 INFO L480 AbstractCegarLoop]: Abstraction has 3997 states and 4345 transitions. [2018-11-06 19:50:51,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 19:50:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 4345 transitions. [2018-11-06 19:50:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-06 19:50:51,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 19:50:51,485 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-06 19:50:51,486 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 19:50:51,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 19:50:51,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1917707251, now seen corresponding path program 1 times [2018-11-06 19:50:51,486 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 19:50:51,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 19:50:51,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:51,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:51,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 19:50:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:51,789 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-06 19:50:52,018 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-06 19:50:52,318 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-06 19:50:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 6 proven. 114 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-06 19:50:52,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 19:50:52,417 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 19:50:52,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 19:50:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 19:50:52,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 19:50:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-06 19:50:52,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 19:50:52,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2018-11-06 19:50:52,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-06 19:50:52,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-06 19:50:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-06 19:50:52,798 INFO L87 Difference]: Start difference. First operand 3997 states and 4345 transitions. Second operand 9 states. [2018-11-06 19:50:53,166 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-06 19:50:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 19:50:58,961 INFO L93 Difference]: Finished difference Result 7589 states and 8269 transitions. [2018-11-06 19:50:58,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 19:50:58,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 214 [2018-11-06 19:50:58,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 19:50:58,964 INFO L225 Difference]: With dead ends: 7589 [2018-11-06 19:50:58,964 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 19:50:58,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 221 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2018-11-06 19:50:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 19:50:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 19:50:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 19:50:58,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 19:50:58,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2018-11-06 19:50:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 19:50:58,972 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 19:50:58,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-06 19:50:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 19:50:58,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 19:50:58,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 19:51:00,886 WARN L179 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2018-11-06 19:51:01,422 WARN L179 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-11-06 19:51:01,427 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-06 19:51:01,427 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-06 19:51:01,427 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,427 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,427 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,427 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,427 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,428 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,428 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-06 19:51:01,428 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-06 19:51:01,428 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-06 19:51:01,428 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-06 19:51:01,428 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-06 19:51:01,428 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-06 19:51:01,428 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-06 19:51:01,428 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-06 19:51:01,429 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-06 19:51:01,429 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-06 19:51:01,429 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,429 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,429 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,429 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,429 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,429 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,430 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-06 19:51:01,430 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-06 19:51:01,430 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-06 19:51:01,430 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-06 19:51:01,430 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-06 19:51:01,430 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-06 19:51:01,430 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-06 19:51:01,430 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-06 19:51:01,430 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-06 19:51:01,431 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-06 19:51:01,431 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-06 19:51:01,431 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-06 19:51:01,431 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-06 19:51:01,431 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-06 19:51:01,431 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-06 19:51:01,431 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,431 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,432 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,432 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,432 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,432 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-06 19:51:01,432 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-06 19:51:01,432 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-06 19:51:01,432 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-06 19:51:01,432 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-06 19:51:01,433 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-06 19:51:01,433 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-06 19:51:01,433 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-06 19:51:01,433 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-06 19:51:01,434 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a17~0 1))) (let ((.cse5 (= ~a12~0 8)) (.cse3 (not (= 5 ~a16~0))) (.cse9 (not .cse0)) (.cse6 (<= ~a20~0 0)) (.cse1 (= ~a21~0 1)) (.cse8 (= ~a16~0 4)) (.cse10 (= ~a16~0 5)) (.cse4 (= ~a8~0 15)) (.cse7 (= ~a7~0 1)) (.cse11 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and .cse7 .cse8 .cse0) (and .cse9 .cse6 .cse10) (and (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse4 .cse0 .cse5 .cse1 .cse2) (and .cse3 (and .cse4 .cse2 .cse9)) (and .cse7 .cse4 (not (= ~a16~0 6)) .cse9) (and .cse4 .cse3 .cse6) (and .cse8 .cse9 .cse6) (and .cse8 .cse11 .cse2) (and .cse7 .cse0 .cse1) (and .cse7 .cse4 .cse10) (and (and .cse7 .cse2) .cse8) (and .cse7 .cse2 .cse10) (and .cse4 .cse11 .cse2) (and .cse7 .cse11 .cse2)))) [2018-11-06 19:51:01,434 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,434 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,434 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,434 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,434 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,434 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 494) no Hoare annotation was computed. [2018-11-06 19:51:01,434 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-06 19:51:01,435 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-06 19:51:01,435 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-06 19:51:01,435 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-06 19:51:01,435 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-06 19:51:01,435 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-06 19:51:01,435 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-06 19:51:01,435 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-06 19:51:01,435 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-06 19:51:01,435 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-06 19:51:01,436 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-06 19:51:01,436 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-06 19:51:01,436 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-06 19:51:01,436 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-11-06 19:51:01,436 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,436 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,436 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,436 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,437 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,437 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-06 19:51:01,437 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-06 19:51:01,437 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-06 19:51:01,437 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-06 19:51:01,437 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-06 19:51:01,437 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-06 19:51:01,437 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-06 19:51:01,437 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-06 19:51:01,438 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-06 19:51:01,438 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,438 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,438 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,438 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,438 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,438 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-06 19:51:01,438 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-06 19:51:01,439 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-06 19:51:01,439 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-06 19:51:01,439 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-06 19:51:01,439 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-06 19:51:01,439 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-06 19:51:01,439 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-06 19:51:01,439 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 19:51:01,439 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-06 19:51:01,439 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-06 19:51:01,440 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-06 19:51:01,440 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-06 19:51:01,440 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-06 19:51:01,440 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-06 19:51:01,440 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-06 19:51:01,440 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,440 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,440 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,441 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a17~0 1))) (let ((.cse9 (not .cse0)) (.cse3 (not (= 5 ~a16~0))) (.cse6 (<= ~a20~0 0)) (.cse5 (= ~a12~0 8)) (.cse1 (= ~a21~0 1)) (.cse8 (= ~a16~0 4)) (.cse10 (= ~a16~0 5)) (.cse4 (= ~a8~0 15)) (.cse7 (= ~a7~0 1)) (.cse11 (<= ~a17~0 0)) (.cse2 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6) (and .cse7 .cse8 .cse0) (and .cse9 .cse6 .cse10) (and .cse3 (and .cse4 .cse2 .cse9)) (and .cse7 .cse4 (not (= ~a16~0 6)) .cse9) (and .cse8 .cse9 .cse6) (and .cse4 .cse3 .cse6) (and .cse8 .cse11 .cse2) (and .cse7 .cse0 .cse1) (and .cse4 .cse5 .cse0 .cse1 .cse2) (and .cse7 .cse4 .cse10) (and (and .cse7 .cse2) .cse8) (and .cse7 .cse2 .cse10) (and .cse4 .cse11 .cse2) (and .cse7 .cse11 .cse2)))) [2018-11-06 19:51:01,441 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,441 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,441 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-06 19:51:01,441 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-06 19:51:01,441 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-06 19:51:01,441 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-06 19:51:01,442 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-06 19:51:01,442 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-06 19:51:01,442 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-06 19:51:01,442 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-06 19:51:01,442 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,442 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,442 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,442 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,443 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,443 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-06 19:51:01,443 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 19:51:01,443 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-06 19:51:01,443 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-06 19:51:01,443 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-06 19:51:01,443 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-06 19:51:01,443 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-06 19:51:01,444 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-06 19:51:01,444 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-06 19:51:01,444 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-06 19:51:01,444 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-06 19:51:01,444 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-06 19:51:01,444 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-06 19:51:01,444 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,444 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,445 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,445 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,445 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,445 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-06 19:51:01,445 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,445 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-06 19:51:01,445 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-06 19:51:01,445 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 19:51:01,445 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-06 19:51:01,446 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-06 19:51:01,446 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-06 19:51:01,446 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-06 19:51:01,446 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-06 19:51:01,446 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-06 19:51:01,446 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-06 19:51:01,446 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-06 19:51:01,446 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-06 19:51:01,446 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-06 19:51:01,446 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,447 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,447 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,447 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,447 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,447 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,447 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-06 19:51:01,447 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-06 19:51:01,447 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-06 19:51:01,447 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-06 19:51:01,448 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-06 19:51:01,448 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-06 19:51:01,448 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-06 19:51:01,448 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-06 19:51:01,448 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-06 19:51:01,448 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-06 19:51:01,448 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-06 19:51:01,448 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-06 19:51:01,448 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 19:51:01,449 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-06 19:51:01,449 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-06 19:51:01,449 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-06 19:51:01,449 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,449 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,449 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,449 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,449 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,450 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-06 19:51:01,450 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-06 19:51:01,450 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-06 19:51:01,450 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-06 19:51:01,450 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-06 19:51:01,450 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-06 19:51:01,450 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-06 19:51:01,450 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-06 19:51:01,451 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-06 19:51:01,451 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-06 19:51:01,451 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-06 19:51:01,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:51:01 BoogieIcfgContainer [2018-11-06 19:51:01,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 19:51:01,488 INFO L168 Benchmark]: Toolchain (without parser) took 32757.07 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -796.9 MB). Peak memory consumption was 284.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:01,490 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 19:51:01,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.19 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:01,491 INFO L168 Benchmark]: Boogie Procedure Inliner took 206.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:01,495 INFO L168 Benchmark]: Boogie Preprocessor took 99.79 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 19:51:01,496 INFO L168 Benchmark]: RCFGBuilder took 3170.58 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:01,497 INFO L168 Benchmark]: TraceAbstraction took 28494.50 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 359.1 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -138.5 MB). Peak memory consumption was 220.7 MB. Max. memory is 7.1 GB. [2018-11-06 19:51:01,507 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 775.19 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 206.90 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 722.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.79 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3170.58 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28494.50 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 359.1 MB). Free memory was 2.1 GB in the beginning and 2.2 GB in the end (delta: -138.5 MB). Peak memory consumption was 220.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 494]: 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: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((a17 == 1 && a21 == 1) && a20 == 1) && !(5 == a16)) || (((a8 == 15 && a12 == 8) && a21 == 1) && a20 <= 0)) || ((a7 == 1 && a16 == 4) && a17 == 1)) || ((!(a17 == 1) && a20 <= 0) && a16 == 5)) || (!(5 == a16) && (a8 == 15 && a20 == 1) && !(a17 == 1))) || (((a7 == 1 && a8 == 15) && !(a16 == 6)) && !(a17 == 1))) || ((a16 == 4 && !(a17 == 1)) && a20 <= 0)) || ((a8 == 15 && !(5 == a16)) && a20 <= 0)) || ((a16 == 4 && a17 <= 0) && a20 == 1)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || ((((a8 == 15 && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || ((a7 == 1 && a20 == 1) && a16 == 4)) || ((a7 == 1 && a20 == 1) && a16 == 5)) || ((a8 == 15 && a17 <= 0) && a20 == 1)) || ((a7 == 1 && a17 <= 0) && a20 == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((a17 == 1 && a21 == 1) && a20 == 1) && !(5 == a16)) || (((a8 == 15 && a12 == 8) && a21 == 1) && a20 <= 0)) || ((a7 == 1 && a16 == 4) && a17 == 1)) || ((!(a17 == 1) && a20 <= 0) && a16 == 5)) || (((((!(1 == input) && a8 == 15) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1)) || (!(5 == a16) && (a8 == 15 && a20 == 1) && !(a17 == 1))) || (((a7 == 1 && a8 == 15) && !(a16 == 6)) && !(a17 == 1))) || ((a8 == 15 && !(5 == a16)) && a20 <= 0)) || ((a16 == 4 && !(a17 == 1)) && a20 <= 0)) || ((a16 == 4 && a17 <= 0) && a20 == 1)) || ((a7 == 1 && a17 == 1) && a21 == 1)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || ((a7 == 1 && a20 == 1) && a16 == 4)) || ((a7 == 1 && a20 == 1) && a16 == 5)) || ((a8 == 15 && a17 <= 0) && a20 == 1)) || ((a7 == 1 && a17 <= 0) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 28.3s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1511 SDtfs, 3742 SDslu, 797 SDs, 0 SdLazy, 9775 SolverSat, 1349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 232 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3997occurred in iteration=9, 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: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 993 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 89 NumberOfFragments, 383 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1635 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 538 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1672 NumberOfCodeBlocks, 1672 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1661 ConstructedInterpolants, 0 QuantifiedInterpolants, 641758 SizeOfPredicates, 1 NumberOfNonLiveVariables, 356 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 622/736 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...