java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:50:41,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:50:41,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:50:41,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:50:41,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:50:41,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:50:41,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:50:41,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:50:41,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:50:41,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:50:41,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:50:41,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:50:41,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:50:41,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:50:41,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:50:41,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:50:41,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:50:41,993 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:50:41,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:50:41,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:50:41,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:50:41,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:50:42,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:50:42,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:50:42,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:50:42,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:50:42,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:50:42,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:50:42,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:50:42,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:50:42,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:50:42,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:50:42,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:50:42,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:50:42,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:50:42,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:50:42,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:50:42,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:50:42,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:50:42,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:50:42,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:50:42,014 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-09-03 19:50:42,028 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:50:42,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:50:42,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:50:42,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:50:42,030 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:50:42,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:50:42,031 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:50:42,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:50:42,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:50:42,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:50:42,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:50:42,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:50:42,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:50:42,032 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:50:42,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:50:42,032 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:50:42,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:50:42,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:50:42,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:50:42,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:50:42,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:50:42,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:50:42,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:50:42,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:50:42,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:50:42,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:50:42,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:50:42,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:50:42,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:50:42,063 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:50:42,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:50:42,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:50:42,085 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:50:42,086 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:50:42,086 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2019-09-03 19:50:42,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897e1a4ab/51bf6c53e2ee4dacb20af280107c7b84/FLAG1ea7ff19e [2019-09-03 19:50:42,601 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:50:42,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2019-09-03 19:50:42,609 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897e1a4ab/51bf6c53e2ee4dacb20af280107c7b84/FLAG1ea7ff19e [2019-09-03 19:50:42,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897e1a4ab/51bf6c53e2ee4dacb20af280107c7b84 [2019-09-03 19:50:42,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:50:42,996 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:50:42,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:50:42,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:50:42,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:50:43,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:50:42" (1/1) ... [2019-09-03 19:50:43,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7cbb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43, skipping insertion in model container [2019-09-03 19:50:43,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:50:42" (1/1) ... [2019-09-03 19:50:43,011 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:50:43,031 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:50:43,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:50:43,208 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:50:43,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:50:43,237 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:50:43,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43 WrapperNode [2019-09-03 19:50:43,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:50:43,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:50:43,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:50:43,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:50:43,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43" (1/1) ... [2019-09-03 19:50:43,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43" (1/1) ... [2019-09-03 19:50:43,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43" (1/1) ... [2019-09-03 19:50:43,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43" (1/1) ... [2019-09-03 19:50:43,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43" (1/1) ... [2019-09-03 19:50:43,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43" (1/1) ... [2019-09-03 19:50:43,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43" (1/1) ... [2019-09-03 19:50:43,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:50:43,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:50:43,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:50:43,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:50:43,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43" (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-09-03 19:50:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:50:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:50:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:50:43,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:50:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:50:43,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:50:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:50:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:50:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:50:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:50:43,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:50:43,665 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:50:43,666 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:50:43,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:50:43 BoogieIcfgContainer [2019-09-03 19:50:43,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:50:43,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:50:43,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:50:43,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:50:43,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:50:42" (1/3) ... [2019-09-03 19:50:43,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cf56c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:50:43, skipping insertion in model container [2019-09-03 19:50:43,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:43" (2/3) ... [2019-09-03 19:50:43,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cf56c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:50:43, skipping insertion in model container [2019-09-03 19:50:43,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:50:43" (3/3) ... [2019-09-03 19:50:43,697 INFO L109 eAbstractionObserver]: Analyzing ICFG large_const.i [2019-09-03 19:50:43,719 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:50:43,732 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:50:43,768 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:50:43,810 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:50:43,811 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:50:43,811 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:50:43,811 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:50:43,811 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:50:43,811 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:50:43,811 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:50:43,812 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:50:43,812 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:50:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-03 19:50:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:50:43,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:43,834 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:43,836 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:43,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:43,842 INFO L82 PathProgramCache]: Analyzing trace with hash 576145336, now seen corresponding path program 1 times [2019-09-03 19:50:43,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:43,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:43,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:43,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:43,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:43,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 19:50:43,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 19:50:43,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 19:50:43,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:50:43,971 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-03 19:50:43,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:43,992 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-09-03 19:50:43,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 19:50:43,993 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-03 19:50:43,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:44,003 INFO L225 Difference]: With dead ends: 40 [2019-09-03 19:50:44,004 INFO L226 Difference]: Without dead ends: 20 [2019-09-03 19:50:44,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 19:50:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-03 19:50:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-03 19:50:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-03 19:50:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-09-03 19:50:44,049 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2019-09-03 19:50:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:44,049 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-09-03 19:50:44,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 19:50:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-09-03 19:50:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:50:44,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:44,051 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:44,051 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:44,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash 893444581, now seen corresponding path program 1 times [2019-09-03 19:50:44,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:44,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:44,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:44,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:44,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:44,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:50:44,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:50:44,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:50:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:50:44,181 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2019-09-03 19:50:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:44,291 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-09-03 19:50:44,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:50:44,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-03 19:50:44,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:44,293 INFO L225 Difference]: With dead ends: 32 [2019-09-03 19:50:44,293 INFO L226 Difference]: Without dead ends: 21 [2019-09-03 19:50:44,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-03 19:50:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-03 19:50:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-03 19:50:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-09-03 19:50:44,307 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2019-09-03 19:50:44,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:44,307 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-09-03 19:50:44,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:50:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-09-03 19:50:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:50:44,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:44,309 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:44,311 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash -884671747, now seen corresponding path program 1 times [2019-09-03 19:50:44,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:44,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:44,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:44,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:44,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:44,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:44,444 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:44,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:44,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:50:44,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:44,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:44,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:44,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-03 19:50:44,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:50:44,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:50:44,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:50:44,608 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2019-09-03 19:50:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:44,783 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2019-09-03 19:50:44,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:44,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-09-03 19:50:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:44,786 INFO L225 Difference]: With dead ends: 41 [2019-09-03 19:50:44,787 INFO L226 Difference]: Without dead ends: 39 [2019-09-03 19:50:44,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:50:44,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-03 19:50:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-09-03 19:50:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-03 19:50:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-09-03 19:50:44,800 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2019-09-03 19:50:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:44,801 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-09-03 19:50:44,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:50:44,801 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-09-03 19:50:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:50:44,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:44,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:44,803 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:44,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash 213378718, now seen corresponding path program 1 times [2019-09-03 19:50:44,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:44,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:44,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:44,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:44,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:44,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:44,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:44,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:50:44,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:44,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:44,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:44,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-03 19:50:44,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:50:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:50:44,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:50:44,954 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 10 states. [2019-09-03 19:50:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:45,089 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2019-09-03 19:50:45,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:45,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-09-03 19:50:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:45,093 INFO L225 Difference]: With dead ends: 51 [2019-09-03 19:50:45,094 INFO L226 Difference]: Without dead ends: 49 [2019-09-03 19:50:45,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:50:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-03 19:50:45,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 37. [2019-09-03 19:50:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 19:50:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2019-09-03 19:50:45,103 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 17 [2019-09-03 19:50:45,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:45,104 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-09-03 19:50:45,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:50:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2019-09-03 19:50:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-03 19:50:45,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:45,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:45,105 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:45,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:45,106 INFO L82 PathProgramCache]: Analyzing trace with hash -595967908, now seen corresponding path program 1 times [2019-09-03 19:50:45,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:45,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:45,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:45,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:45,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:45,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:45,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:45,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:45,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:50:45,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:45,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:45,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-09-03 19:50:45,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:50:45,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:50:45,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:50:45,272 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 10 states. [2019-09-03 19:50:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:45,393 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-09-03 19:50:45,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:45,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-09-03 19:50:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:45,395 INFO L225 Difference]: With dead ends: 55 [2019-09-03 19:50:45,395 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 19:50:45,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-03 19:50:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 19:50:45,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2019-09-03 19:50:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:50:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2019-09-03 19:50:45,416 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 17 [2019-09-03 19:50:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:45,417 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-09-03 19:50:45,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:50:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2019-09-03 19:50:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 19:50:45,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:45,419 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:45,419 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1650045878, now seen corresponding path program 1 times [2019-09-03 19:50:45,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:45,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:45,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:45,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:45,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:45,490 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:45,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:45,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:50:45,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:45,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:50:45,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-09-03 19:50:45,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:45,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:45,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:45,565 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 6 states. [2019-09-03 19:50:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:45,603 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2019-09-03 19:50:45,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:50:45,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-03 19:50:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:45,607 INFO L225 Difference]: With dead ends: 61 [2019-09-03 19:50:45,607 INFO L226 Difference]: Without dead ends: 29 [2019-09-03 19:50:45,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-09-03 19:50:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-09-03 19:50:45,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-03 19:50:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-09-03 19:50:45,622 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2019-09-03 19:50:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:45,622 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-09-03 19:50:45,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-09-03 19:50:45,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-03 19:50:45,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:45,626 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:45,626 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:45,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:45,626 INFO L82 PathProgramCache]: Analyzing trace with hash -785465255, now seen corresponding path program 1 times [2019-09-03 19:50:45,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:45,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:45,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:45,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:45,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:45,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:45,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:45,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:45,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-03 19:50:45,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:45,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:50:45,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-03 19:50:45,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:50:45,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:50:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:50:45,822 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 11 states. [2019-09-03 19:50:46,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:46,054 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-09-03 19:50:46,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:50:46,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-09-03 19:50:46,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:46,055 INFO L225 Difference]: With dead ends: 39 [2019-09-03 19:50:46,055 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:50:46,056 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2019-09-03 19:50:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:50:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:50:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:50:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:50:46,057 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-09-03 19:50:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:46,057 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:50:46,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:50:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:50:46,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:50:46,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:50:46,428 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 19:50:46,429 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:50:46,429 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:50:46,429 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:50:46,429 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:50:46,429 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:50:46,429 INFO L439 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 10000 main_~c3~0) (<= 2000 main_~c2~0) (<= 4000 main_~c1~0) (<= 1 main_~i~0) (< main_~n~0 2) (<= 2000 main_~k~0)) [2019-09-03 19:50:46,430 INFO L443 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2019-09-03 19:50:46,430 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 38) no Hoare annotation was computed. [2019-09-03 19:50:46,430 INFO L443 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-09-03 19:50:46,430 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-09-03 19:50:46,430 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 38) no Hoare annotation was computed. [2019-09-03 19:50:46,430 INFO L439 ceAbstractionStarter]: At program point L32-2(lines 32 36) the Hoare annotation is: (let ((.cse1 (<= 10000 main_~c3~0)) (.cse2 (<= 2000 main_~c2~0)) (.cse3 (<= 4000 main_~c1~0)) (.cse0 (<= 1 main_~i~0)) (.cse4 (< main_~n~0 2))) (or (and (<= main_~n~0 0) (<= main_~i~0 0) (<= main_~n~0 main_~j~0)) (and (<= 0 main_~j~0) .cse0 (and .cse1 (and .cse2 .cse3 (<= 2000 main_~k~0))) .cse4) (and .cse1 .cse2 .cse3 .cse0 (<= 1 main_~j~0) .cse4))) [2019-09-03 19:50:46,430 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 38) the Hoare annotation is: true [2019-09-03 19:50:46,431 INFO L443 ceAbstractionStarter]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2019-09-03 19:50:46,431 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-09-03 19:50:46,431 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-09-03 19:50:46,431 INFO L439 ceAbstractionStarter]: At program point L26-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (<= 10000 main_~c3~0)) (.cse1 (<= 2000 main_~c2~0)) (.cse2 (<= 4000 main_~c1~0))) (or (and .cse0 .cse1 .cse2 (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~i~0 0)) (and (and .cse0 .cse1 .cse2 (<= 1 main_~i~0) (<= 2000 main_~k~0)) (< main_~n~0 2)))) [2019-09-03 19:50:46,431 INFO L443 ceAbstractionStarter]: For program point L20-2(lines 20 30) no Hoare annotation was computed. [2019-09-03 19:50:46,431 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-03 19:50:46,432 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-03 19:50:46,432 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:50:46,432 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-03 19:50:46,432 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-03 19:50:46,432 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:50:46,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:50:46 BoogieIcfgContainer [2019-09-03 19:50:46,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:50:46,458 INFO L168 Benchmark]: Toolchain (without parser) took 3459.37 ms. Allocated memory was 139.5 MB in the beginning and 261.1 MB in the end (delta: 121.6 MB). Free memory was 86.9 MB in the beginning and 212.3 MB in the end (delta: -125.4 MB). Peak memory consumption was 102.0 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:46,460 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 139.5 MB. Free memory was 105.5 MB in the beginning and 105.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:50:46,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.76 ms. Allocated memory is still 139.5 MB. Free memory was 86.7 MB in the beginning and 77.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:46,462 INFO L168 Benchmark]: Boogie Preprocessor took 140.55 ms. Allocated memory was 139.5 MB in the beginning and 199.8 MB in the end (delta: 60.3 MB). Free memory was 77.1 MB in the beginning and 177.2 MB in the end (delta: -100.1 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:46,465 INFO L168 Benchmark]: RCFGBuilder took 287.97 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 163.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:46,470 INFO L168 Benchmark]: TraceAbstraction took 2777.31 ms. Allocated memory was 199.8 MB in the beginning and 261.1 MB in the end (delta: 61.3 MB). Free memory was 162.9 MB in the beginning and 212.3 MB in the end (delta: -49.5 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:46,478 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.41 ms. Allocated memory is still 139.5 MB. Free memory was 105.5 MB in the beginning and 105.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 241.76 ms. Allocated memory is still 139.5 MB. Free memory was 86.7 MB in the beginning and 77.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.55 ms. Allocated memory was 139.5 MB in the beginning and 199.8 MB in the end (delta: 60.3 MB). Free memory was 77.1 MB in the beginning and 177.2 MB in the end (delta: -100.1 MB). Peak memory consumption was 11.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 287.97 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 163.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2777.31 ms. Allocated memory was 199.8 MB in the beginning and 261.1 MB in the end (delta: 61.3 MB). Free memory was 162.9 MB in the beginning and 212.3 MB in the end (delta: -49.5 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 20]: Loop Invariant Derived loop invariant: (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 0 <= i) && 0 <= k) && i <= 0) || (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && 2000 <= k) && n < 2) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((n <= 0 && i <= 0) && n <= j) || (((0 <= j && 1 <= i) && 10000 <= c3 && (2000 <= c2 && 4000 <= c1) && 2000 <= k) && n < 2)) || (((((10000 <= c3 && 2000 <= c2) && 4000 <= c1) && 1 <= i) && 1 <= j) && n < 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 163 SDtfs, 135 SDslu, 536 SDs, 0 SdLazy, 328 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 24 NumberOfFragments, 123 HoareAnnotationTreeSize, 14 FomulaSimplifications, 332 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 249 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 8528 SizeOfPredicates, 12 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 16/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...