/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:51:38,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:51:38,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:51:38,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:51:38,820 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:51:38,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:51:38,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:51:38,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:51:38,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:51:38,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:51:38,837 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:51:38,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:51:38,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:51:38,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:51:38,840 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:51:38,841 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:51:38,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:51:38,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:51:38,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:51:38,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:51:38,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:51:38,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:51:38,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:51:38,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:51:38,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:51:38,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:51:38,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:51:38,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:51:38,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:51:38,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:51:38,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:51:38,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:51:38,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:51:38,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:51:38,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:51:38,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:51:38,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:51:38,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:51:38,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:51:38,871 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:51:38,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:51:38,875 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:51:38,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:51:38,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:51:38,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:51:38,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:51:38,890 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:51:38,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:51:38,890 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:51:38,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:51:38,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:51:38,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:51:38,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:51:38,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:51:38,892 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:51:38,892 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:51:38,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:51:38,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:51:38,892 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:51:38,893 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:51:38,893 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:51:38,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:51:38,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:51:38,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:51:38,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:51:38,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:51:38,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:51:38,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:51:38,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:51:38,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:51:38,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:51:38,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:51:39,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:51:39,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:51:39,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:51:39,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:51:39,190 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:51:39,190 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label13.c [2019-11-23 20:51:39,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575452b65/03eb47eba614441bb4056f040aefb3a8/FLAG036385178 [2019-11-23 20:51:39,811 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:51:39,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label13.c [2019-11-23 20:51:39,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575452b65/03eb47eba614441bb4056f040aefb3a8/FLAG036385178 [2019-11-23 20:51:40,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575452b65/03eb47eba614441bb4056f040aefb3a8 [2019-11-23 20:51:40,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:51:40,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:51:40,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:40,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:51:40,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:51:40,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ffb995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40, skipping insertion in model container [2019-11-23 20:51:40,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:51:40,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:51:40,687 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:40,695 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:51:40,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:51:40,811 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:51:40,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40 WrapperNode [2019-11-23 20:51:40,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:51:40,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:40,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:51:40,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:51:40,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:51:40,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:51:40,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:51:40,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:51:40,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (1/1) ... [2019-11-23 20:51:40,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:51:40,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:51:40,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:51:40,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:51:40,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:51:41,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:51:41,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:51:42,395 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:51:42,396 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:51:42,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:42 BoogieIcfgContainer [2019-11-23 20:51:42,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:51:42,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:51:42,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:51:42,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:51:42,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:51:40" (1/3) ... [2019-11-23 20:51:42,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c469c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:42, skipping insertion in model container [2019-11-23 20:51:42,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:51:40" (2/3) ... [2019-11-23 20:51:42,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c469c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:51:42, skipping insertion in model container [2019-11-23 20:51:42,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:51:42" (3/3) ... [2019-11-23 20:51:42,412 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label13.c [2019-11-23 20:51:42,424 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:51:42,432 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:51:42,444 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:51:42,484 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:51:42,485 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:51:42,485 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:51:42,485 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:51:42,486 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:51:42,486 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:51:42,486 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:51:42,486 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:51:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:51:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-23 20:51:42,522 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:42,524 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:42,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:42,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1419855070, now seen corresponding path program 1 times [2019-11-23 20:51:42,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:42,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112486537] [2019-11-23 20:51:42,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:43,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112486537] [2019-11-23 20:51:43,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:43,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:43,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642313247] [2019-11-23 20:51:43,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:43,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:43,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:43,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:43,169 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-23 20:51:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:44,439 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-23 20:51:44,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:51:44,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-23 20:51:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:44,459 INFO L225 Difference]: With dead ends: 662 [2019-11-23 20:51:44,459 INFO L226 Difference]: Without dead ends: 397 [2019-11-23 20:51:44,463 INFO L630 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 [2019-11-23 20:51:44,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-23 20:51:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-23 20:51:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-23 20:51:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-23 20:51:44,530 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 123 [2019-11-23 20:51:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:44,531 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-23 20:51:44,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-23 20:51:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-23 20:51:44,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:44,536 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:44,536 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:44,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1345449990, now seen corresponding path program 1 times [2019-11-23 20:51:44,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:44,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253446166] [2019-11-23 20:51:44,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:51:44,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253446166] [2019-11-23 20:51:44,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:44,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:44,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699756026] [2019-11-23 20:51:44,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:44,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:44,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:44,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:44,628 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-23 20:51:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:45,255 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-23 20:51:45,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:45,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-11-23 20:51:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:45,261 INFO L225 Difference]: With dead ends: 1185 [2019-11-23 20:51:45,261 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:51:45,269 INFO L630 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 [2019-11-23 20:51:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:51:45,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-23 20:51:45,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-23 20:51:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-23 20:51:45,325 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 128 [2019-11-23 20:51:45,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:45,326 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-23 20:51:45,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:45,326 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-23 20:51:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 20:51:45,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:45,334 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:45,334 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash -139497956, now seen corresponding path program 1 times [2019-11-23 20:51:45,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:45,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86504161] [2019-11-23 20:51:45,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:51:45,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86504161] [2019-11-23 20:51:45,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:45,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:45,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830474502] [2019-11-23 20:51:45,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:45,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:45,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:45,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:45,464 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-23 20:51:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:46,013 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-11-23 20:51:46,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:46,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-23 20:51:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:46,022 INFO L225 Difference]: With dead ends: 1971 [2019-11-23 20:51:46,023 INFO L226 Difference]: Without dead ends: 1183 [2019-11-23 20:51:46,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-23 20:51:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-11-23 20:51:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-23 20:51:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-23 20:51:46,067 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 149 [2019-11-23 20:51:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:46,069 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-23 20:51:46,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-23 20:51:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-23 20:51:46,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:46,091 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:46,091 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:46,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2073958119, now seen corresponding path program 1 times [2019-11-23 20:51:46,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:46,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900087350] [2019-11-23 20:51:46,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-23 20:51:46,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900087350] [2019-11-23 20:51:46,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:46,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:46,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018142763] [2019-11-23 20:51:46,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:46,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:46,355 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-23 20:51:46,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:46,894 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-23 20:51:46,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:46,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-11-23 20:51:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:46,902 INFO L225 Difference]: With dead ends: 2233 [2019-11-23 20:51:46,903 INFO L226 Difference]: Without dead ends: 1314 [2019-11-23 20:51:46,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:46,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-23 20:51:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-23 20:51:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-23 20:51:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1526 transitions. [2019-11-23 20:51:46,940 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1526 transitions. Word has length 185 [2019-11-23 20:51:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:46,941 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1526 transitions. [2019-11-23 20:51:46,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1526 transitions. [2019-11-23 20:51:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-11-23 20:51:46,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:46,946 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:46,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:46,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash 146303237, now seen corresponding path program 1 times [2019-11-23 20:51:46,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:46,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161484158] [2019-11-23 20:51:46,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:51:47,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161484158] [2019-11-23 20:51:47,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:47,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:47,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734186201] [2019-11-23 20:51:47,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:51:47,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:47,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:51:47,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:51:47,097 INFO L87 Difference]: Start difference. First operand 1183 states and 1526 transitions. Second operand 4 states. [2019-11-23 20:51:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:47,726 INFO L93 Difference]: Finished difference Result 2500 states and 3204 transitions. [2019-11-23 20:51:47,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:51:47,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-11-23 20:51:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:47,735 INFO L225 Difference]: With dead ends: 2500 [2019-11-23 20:51:47,735 INFO L226 Difference]: Without dead ends: 1319 [2019-11-23 20:51:47,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:47,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-23 20:51:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1314. [2019-11-23 20:51:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-23 20:51:47,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1663 transitions. [2019-11-23 20:51:47,775 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1663 transitions. Word has length 193 [2019-11-23 20:51:47,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:47,775 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1663 transitions. [2019-11-23 20:51:47,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:51:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1663 transitions. [2019-11-23 20:51:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-23 20:51:47,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:47,782 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:47,783 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:47,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:47,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1732240947, now seen corresponding path program 1 times [2019-11-23 20:51:47,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:47,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119430787] [2019-11-23 20:51:47,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:51:47,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119430787] [2019-11-23 20:51:47,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:47,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:51:47,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930126655] [2019-11-23 20:51:47,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:51:47,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:47,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:51:47,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:47,909 INFO L87 Difference]: Start difference. First operand 1314 states and 1663 transitions. Second operand 5 states. [2019-11-23 20:51:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:48,918 INFO L93 Difference]: Finished difference Result 2757 states and 3527 transitions. [2019-11-23 20:51:48,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:51:48,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 197 [2019-11-23 20:51:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:48,927 INFO L225 Difference]: With dead ends: 2757 [2019-11-23 20:51:48,927 INFO L226 Difference]: Without dead ends: 1576 [2019-11-23 20:51:48,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:51:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-23 20:51:48,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-23 20:51:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-23 20:51:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1949 transitions. [2019-11-23 20:51:48,968 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1949 transitions. Word has length 197 [2019-11-23 20:51:48,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:48,970 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1949 transitions. [2019-11-23 20:51:48,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:51:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1949 transitions. [2019-11-23 20:51:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-23 20:51:48,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:48,975 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:48,975 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:48,976 INFO L82 PathProgramCache]: Analyzing trace with hash -794045742, now seen corresponding path program 1 times [2019-11-23 20:51:48,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:48,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381120274] [2019-11-23 20:51:48,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:51:49,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381120274] [2019-11-23 20:51:49,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:49,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:51:49,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132423284] [2019-11-23 20:51:49,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:49,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:49,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:49,083 INFO L87 Difference]: Start difference. First operand 1576 states and 1949 transitions. Second operand 3 states. [2019-11-23 20:51:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:49,588 INFO L93 Difference]: Finished difference Result 3412 states and 4236 transitions. [2019-11-23 20:51:49,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:49,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-11-23 20:51:49,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:49,595 INFO L225 Difference]: With dead ends: 3412 [2019-11-23 20:51:49,596 INFO L226 Difference]: Without dead ends: 1707 [2019-11-23 20:51:49,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-23 20:51:49,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-11-23 20:51:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-23 20:51:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1732 transitions. [2019-11-23 20:51:49,626 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1732 transitions. Word has length 200 [2019-11-23 20:51:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:49,626 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1732 transitions. [2019-11-23 20:51:49,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1732 transitions. [2019-11-23 20:51:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-23 20:51:49,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:49,631 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:49,631 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:49,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:49,632 INFO L82 PathProgramCache]: Analyzing trace with hash 933247694, now seen corresponding path program 1 times [2019-11-23 20:51:49,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:49,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435634243] [2019-11-23 20:51:49,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-23 20:51:49,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435634243] [2019-11-23 20:51:49,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:51:49,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:51:49,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711296350] [2019-11-23 20:51:49,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:49,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:49,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:49,735 INFO L87 Difference]: Start difference. First operand 1576 states and 1732 transitions. Second operand 3 states. [2019-11-23 20:51:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:50,236 INFO L93 Difference]: Finished difference Result 3543 states and 3930 transitions. [2019-11-23 20:51:50,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:50,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-11-23 20:51:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:50,245 INFO L225 Difference]: With dead ends: 3543 [2019-11-23 20:51:50,245 INFO L226 Difference]: Without dead ends: 2100 [2019-11-23 20:51:50,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:51:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-23 20:51:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-11-23 20:51:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:51:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2004 transitions. [2019-11-23 20:51:50,303 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2004 transitions. Word has length 215 [2019-11-23 20:51:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:50,304 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2004 transitions. [2019-11-23 20:51:50,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:50,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2004 transitions. [2019-11-23 20:51:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-23 20:51:50,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:50,315 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:50,315 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:50,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:50,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1158107046, now seen corresponding path program 1 times [2019-11-23 20:51:50,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:50,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694333174] [2019-11-23 20:51:50,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 27 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-23 20:51:50,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694333174] [2019-11-23 20:51:50,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778875288] [2019-11-23 20:51:50,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:50,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:51:50,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:51:50,897 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-11-23 20:51:50,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:51:50,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:51:50,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809325960] [2019-11-23 20:51:50,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:50,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:51:50,900 INFO L87 Difference]: Start difference. First operand 1838 states and 2004 transitions. Second operand 3 states. [2019-11-23 20:51:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:51,288 INFO L93 Difference]: Finished difference Result 1840 states and 2005 transitions. [2019-11-23 20:51:51,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:51,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-23 20:51:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:51,296 INFO L225 Difference]: With dead ends: 1840 [2019-11-23 20:51:51,297 INFO L226 Difference]: Without dead ends: 1838 [2019-11-23 20:51:51,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:51:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-23 20:51:51,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-11-23 20:51:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:51:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1851 transitions. [2019-11-23 20:51:51,331 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1851 transitions. Word has length 244 [2019-11-23 20:51:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:51,332 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1851 transitions. [2019-11-23 20:51:51,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1851 transitions. [2019-11-23 20:51:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-11-23 20:51:51,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:51:51,338 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:51:51,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:51,551 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:51:51,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:51:51,552 INFO L82 PathProgramCache]: Analyzing trace with hash -288373199, now seen corresponding path program 1 times [2019-11-23 20:51:51,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:51:51,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587983592] [2019-11-23 20:51:51,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:51:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 173 proven. 27 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-23 20:51:51,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587983592] [2019-11-23 20:51:51,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893228703] [2019-11-23 20:51:51,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:51:51,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:51:51,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:51:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-23 20:51:51,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:51:51,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:51:51,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787966139] [2019-11-23 20:51:51,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:51:51,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:51:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:51:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:51:51,983 INFO L87 Difference]: Start difference. First operand 1707 states and 1851 transitions. Second operand 3 states. [2019-11-23 20:51:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:51:52,488 INFO L93 Difference]: Finished difference Result 3672 states and 3998 transitions. [2019-11-23 20:51:52,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:51:52,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-11-23 20:51:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:51:52,491 INFO L225 Difference]: With dead ends: 3672 [2019-11-23 20:51:52,491 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:51:52,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 268 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:51:52,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:51:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:51:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:51:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:51:52,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 268 [2019-11-23 20:51:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:51:52,496 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:51:52,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:51:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:51:52,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:51:52,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:51:52,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:51:52,953 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-11-23 20:51:53,060 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-11-23 20:51:53,063 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:51:53,063 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:51:53,064 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,064 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,064 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,064 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,064 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,064 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,064 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:51:53,065 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:51:53,065 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:51:53,065 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:51:53,065 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:51:53,065 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:51:53,065 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:51:53,065 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:51:53,066 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:51:53,066 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:51:53,066 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,066 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,066 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,066 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,066 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,067 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,067 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:51:53,067 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:51:53,067 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:51:53,067 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:51:53,067 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:51:53,068 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:51:53,068 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:51:53,068 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:51:53,068 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:51:53,068 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:51:53,068 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:51:53,068 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:51:53,105 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:51:53,106 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:51:53,106 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:51:53,106 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,106 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,106 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,106 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,106 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,106 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:51:53,107 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:51:53,107 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:51:53,107 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:51:53,107 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:51:53,107 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:51:53,107 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:51:53,107 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:51:53,107 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:51:53,109 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1)) (.cse1 (<= ~a8~0 13))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= ~a17~0 1) .cse0 (= ~a20~0 1)) (and .cse0 (= 15 ~a8~0)) (and .cse1 (= 1 ~a7~0) (<= ~a21~0 0)))) [2019-11-23 20:51:53,109 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,109 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,110 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,110 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,110 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,110 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:51:53,110 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:51:53,110 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:51:53,110 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:51:53,110 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:51:53,110 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:51:53,111 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:51:53,112 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:51:53,112 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:51:53,112 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:51:53,112 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:51:53,112 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:51:53,112 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:51:53,112 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:51:53,112 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,113 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,113 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,113 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,113 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,113 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:51:53,113 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:51:53,113 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:51:53,113 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:51:53,113 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:51:53,114 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:51:53,114 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:51:53,114 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:51:53,114 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:51:53,114 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,114 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,114 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,114 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,114 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:51:53,115 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,115 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:51:53,115 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:51:53,115 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:51:53,115 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:51:53,115 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:51:53,115 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:51:53,115 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:51:53,115 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:51:53,116 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:51:53,116 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:51:53,116 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:51:53,116 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:51:53,116 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:51:53,116 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:51:53,116 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,116 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1)) (.cse1 (<= ~a8~0 13))) (or (and (not (= ~a16~0 6)) .cse0) (and .cse1 (= ~a17~0 1) .cse0 (= ~a20~0 1)) (and .cse0 (= 15 ~a8~0)) (and .cse1 (= 1 ~a7~0) (<= ~a21~0 0)))) [2019-11-23 20:51:53,117 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,117 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,117 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,117 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,117 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:51:53,117 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:51:53,117 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:51:53,117 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:51:53,118 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:51:53,118 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:51:53,118 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:51:53,118 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:51:53,118 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,118 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,119 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,119 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,119 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,119 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:51:53,119 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:51:53,119 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:51:53,119 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:51:53,119 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:51:53,119 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:51:53,120 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:51:53,120 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:51:53,120 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:51:53,120 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:51:53,120 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:51:53,120 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:51:53,120 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:51:53,120 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,121 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,121 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,121 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,121 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:51:53,121 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,121 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,121 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:51:53,121 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:51:53,121 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:51:53,121 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:51:53,122 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:51:53,122 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:51:53,122 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:51:53,122 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:51:53,122 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:51:53,122 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:51:53,122 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:51:53,122 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:51:53,122 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:51:53,123 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,123 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,123 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,123 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,123 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,123 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:51:53,123 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,123 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:51:53,123 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:51:53,124 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:51:53,124 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:51:53,124 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:51:53,124 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:51:53,124 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:51:53,124 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:51:53,124 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:51:53,124 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:51:53,124 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:51:53,124 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:51:53,125 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 545) no Hoare annotation was computed. [2019-11-23 20:51:53,125 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:51:53,125 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:51:53,125 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:51:53,125 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,125 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,125 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,125 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,126 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,126 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:51:53,126 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:51:53,126 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:51:53,126 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:51:53,126 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:51:53,126 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:51:53,126 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:51:53,126 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:51:53,127 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:51:53,127 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:51:53,127 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:51:53,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:51:53 BoogieIcfgContainer [2019-11-23 20:51:53,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:51:53,159 INFO L168 Benchmark]: Toolchain (without parser) took 13041.55 ms. Allocated memory was 137.4 MB in the beginning and 458.8 MB in the end (delta: 321.4 MB). Free memory was 100.2 MB in the beginning and 409.3 MB in the end (delta: -309.1 MB). Peak memory consumption was 343.8 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:53,160 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 20:51:53,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.05 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.0 MB in the beginning and 164.2 MB in the end (delta: -64.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:53,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.68 ms. Allocated memory is still 202.4 MB. Free memory was 164.2 MB in the beginning and 158.5 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:53,166 INFO L168 Benchmark]: Boogie Preprocessor took 70.42 ms. Allocated memory is still 202.4 MB. Free memory was 158.5 MB in the beginning and 153.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:53,168 INFO L168 Benchmark]: RCFGBuilder took 1421.65 ms. Allocated memory was 202.4 MB in the beginning and 233.3 MB in the end (delta: 30.9 MB). Free memory was 153.5 MB in the beginning and 162.4 MB in the end (delta: -8.9 MB). Peak memory consumption was 77.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:53,173 INFO L168 Benchmark]: TraceAbstraction took 10755.72 ms. Allocated memory was 233.3 MB in the beginning and 458.8 MB in the end (delta: 225.4 MB). Free memory was 162.4 MB in the beginning and 409.3 MB in the end (delta: -246.9 MB). Peak memory consumption was 310.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:51:53,184 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 695.05 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 100.0 MB in the beginning and 164.2 MB in the end (delta: -64.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 93.68 ms. Allocated memory is still 202.4 MB. Free memory was 164.2 MB in the beginning and 158.5 MB in the end (delta: 5.7 MB). Peak memory consumption was 5.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.42 ms. Allocated memory is still 202.4 MB. Free memory was 158.5 MB in the beginning and 153.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1421.65 ms. Allocated memory was 202.4 MB in the beginning and 233.3 MB in the end (delta: 30.9 MB). Free memory was 153.5 MB in the beginning and 162.4 MB in the end (delta: -8.9 MB). Peak memory consumption was 77.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10755.72 ms. Allocated memory was 233.3 MB in the beginning and 458.8 MB in the end (delta: 225.4 MB). Free memory was 162.4 MB in the beginning and 409.3 MB in the end (delta: -246.9 MB). Peak memory consumption was 310.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 545]: 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: 30]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (((a8 <= 13 && a17 == 1) && a21 == 1) && a20 == 1)) || (a21 == 1 && 15 == a8)) || ((a8 <= 13 && 1 == a7) && a21 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (((a8 <= 13 && a17 == 1) && a21 == 1) && a20 == 1)) || (a21 == 1 && 15 == a8)) || ((a8 <= 13 && 1 == a7) && a21 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 10.6s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 889 SDtfs, 1766 SDslu, 90 SDs, 0 SdLazy, 4474 SolverSat, 672 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 521 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 922 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 79 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1953 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 232 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2414 NumberOfCodeBlocks, 2414 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2402 ConstructedInterpolants, 0 QuantifiedInterpolants, 1062390 SizeOfPredicates, 2 NumberOfNonLiveVariables, 889 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 1912/1966 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...