./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/large_const_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loop-invgen/large_const_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b03e1cb325e2c3a8ef30197a8e07012b3a728d97 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 11:19:13,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:19:13,916 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:19:13,931 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:19:13,931 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:19:13,933 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:19:13,934 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:19:13,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:19:13,938 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:19:13,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:19:13,940 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:19:13,941 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:19:13,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:19:13,943 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:19:13,944 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:19:13,945 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:19:13,945 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:19:13,948 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:19:13,952 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:19:13,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:19:13,954 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:19:13,955 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:19:13,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:19:13,957 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:19:13,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:19:13,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:19:13,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:19:13,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:19:13,960 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:19:13,961 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:19:13,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:19:13,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:19:13,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:19:13,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:19:13,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:19:13,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:19:13,965 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 11:19:13,984 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:19:13,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:19:13,985 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:19:13,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:19:13,986 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:19:13,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:19:13,986 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:19:13,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:19:13,987 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:19:13,988 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:19:13,989 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:19:13,989 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:19:13,989 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:19:13,989 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:19:13,989 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:19:13,989 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:19:13,990 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:19:13,990 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:19:13,990 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:19:13,990 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:19:13,990 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:19:13,990 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:19:13,991 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:19:13,991 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:19:13,991 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:19:13,991 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:19:13,991 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:19:13,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:19:13,992 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b03e1cb325e2c3a8ef30197a8e07012b3a728d97 [2019-01-12 11:19:14,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:19:14,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:19:14,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:19:14,071 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:19:14,071 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:19:14,072 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/large_const_true-unreach-call_true-termination.i [2019-01-12 11:19:14,127 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a801f7c8/9cdc53c5470342fbab84518f436bf07e/FLAGf30b68fea [2019-01-12 11:19:14,545 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:19:14,546 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/large_const_true-unreach-call_true-termination.i [2019-01-12 11:19:14,554 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a801f7c8/9cdc53c5470342fbab84518f436bf07e/FLAGf30b68fea [2019-01-12 11:19:14,908 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a801f7c8/9cdc53c5470342fbab84518f436bf07e [2019-01-12 11:19:14,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:19:14,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:19:14,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:19:14,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:19:14,917 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:19:14,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:19:14" (1/1) ... [2019-01-12 11:19:14,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1a718d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:14, skipping insertion in model container [2019-01-12 11:19:14,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:19:14" (1/1) ... [2019-01-12 11:19:14,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:19:14,947 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:19:15,117 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:19:15,124 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:19:15,148 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:19:15,166 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:19:15,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15 WrapperNode [2019-01-12 11:19:15,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:19:15,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:19:15,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:19:15,170 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:19:15,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (1/1) ... [2019-01-12 11:19:15,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (1/1) ... [2019-01-12 11:19:15,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:19:15,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:19:15,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:19:15,210 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:19:15,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (1/1) ... [2019-01-12 11:19:15,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (1/1) ... [2019-01-12 11:19:15,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (1/1) ... [2019-01-12 11:19:15,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (1/1) ... [2019-01-12 11:19:15,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (1/1) ... [2019-01-12 11:19:15,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (1/1) ... [2019-01-12 11:19:15,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (1/1) ... [2019-01-12 11:19:15,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:19:15,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:19:15,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:19:15,229 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:19:15,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:19:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:19:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:19:15,624 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:19:15,625 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-12 11:19:15,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:19:15 BoogieIcfgContainer [2019-01-12 11:19:15,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:19:15,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:19:15,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:19:15,631 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:19:15,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:19:14" (1/3) ... [2019-01-12 11:19:15,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a193a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:19:15, skipping insertion in model container [2019-01-12 11:19:15,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:15" (2/3) ... [2019-01-12 11:19:15,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a193a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:19:15, skipping insertion in model container [2019-01-12 11:19:15,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:19:15" (3/3) ... [2019-01-12 11:19:15,635 INFO L112 eAbstractionObserver]: Analyzing ICFG large_const_true-unreach-call_true-termination.i [2019-01-12 11:19:15,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:19:15,667 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 11:19:15,685 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 11:19:15,716 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:19:15,717 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:19:15,717 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:19:15,717 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:19:15,717 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:19:15,717 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:19:15,717 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:19:15,717 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:19:15,718 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:19:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-01-12 11:19:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 11:19:15,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:15,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:15,743 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:15,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:15,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1461315706, now seen corresponding path program 1 times [2019-01-12 11:19:15,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:15,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:15,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:15,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:19:15,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 11:19:15,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 11:19:15,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 11:19:15,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 11:19:15,868 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 2 states. [2019-01-12 11:19:15,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:15,884 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2019-01-12 11:19:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 11:19:15,886 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2019-01-12 11:19:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:15,897 INFO L225 Difference]: With dead ends: 26 [2019-01-12 11:19:15,897 INFO L226 Difference]: Without dead ends: 12 [2019-01-12 11:19:15,900 INFO L631 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-01-12 11:19:15,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-12 11:19:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-12 11:19:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 11:19:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2019-01-12 11:19:15,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 7 [2019-01-12 11:19:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:15,934 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-12 11:19:15,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 11:19:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2019-01-12 11:19:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 11:19:15,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:15,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:15,935 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:15,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:15,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1479786126, now seen corresponding path program 1 times [2019-01-12 11:19:15,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:15,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:15,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:15,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:15,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:16,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:19:16,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:19:16,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:19:16,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:19:16,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:19:16,031 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 5 states. [2019-01-12 11:19:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:16,174 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-01-12 11:19:16,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:19:16,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-12 11:19:16,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:16,176 INFO L225 Difference]: With dead ends: 20 [2019-01-12 11:19:16,176 INFO L226 Difference]: Without dead ends: 13 [2019-01-12 11:19:16,177 INFO L631 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-01-12 11:19:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-12 11:19:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-12 11:19:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-12 11:19:16,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-01-12 11:19:16,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2019-01-12 11:19:16,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:16,182 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-12 11:19:16,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:19:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2019-01-12 11:19:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:19:16,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:16,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:16,185 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:16,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:16,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1660828652, now seen corresponding path program 1 times [2019-01-12 11:19:16,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:16,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:16,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:16,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:16,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:16,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:16,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:19:16,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:19:16,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:16,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:19:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:16,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:19:16,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-12 11:19:16,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:19:16,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:19:16,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:19:16,561 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 7 states. [2019-01-12 11:19:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:16,971 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2019-01-12 11:19:16,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:19:16,972 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-01-12 11:19:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:16,973 INFO L225 Difference]: With dead ends: 31 [2019-01-12 11:19:16,973 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 11:19:16,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:19:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 11:19:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2019-01-12 11:19:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 11:19:16,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-12 11:19:16,980 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2019-01-12 11:19:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:16,981 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-12 11:19:16,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:19:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-01-12 11:19:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:19:16,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:16,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:16,982 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:16,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2129936810, now seen corresponding path program 1 times [2019-01-12 11:19:16,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:16,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:16,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:17,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:19:17,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:19:17,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:17,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:19:17,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:17,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:19:17,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-12 11:19:17,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:19:17,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:19:17,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:19:17,221 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 7 states. [2019-01-12 11:19:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:17,521 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-01-12 11:19:17,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:19:17,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-12 11:19:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:17,523 INFO L225 Difference]: With dead ends: 37 [2019-01-12 11:19:17,524 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 11:19:17,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:19:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 11:19:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-01-12 11:19:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 11:19:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-01-12 11:19:17,535 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 11 [2019-01-12 11:19:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:17,538 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-01-12 11:19:17,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:19:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2019-01-12 11:19:17,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:19:17,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:17,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:17,539 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:17,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2107772184, now seen corresponding path program 1 times [2019-01-12 11:19:17,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:17,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:17,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:17,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:19:17,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:19:17,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:17,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:19:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:17,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:19:17,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-12 11:19:17,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:19:17,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:19:17,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:19:17,861 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 7 states. [2019-01-12 11:19:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:18,031 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-01-12 11:19:18,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:19:18,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-12 11:19:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:18,033 INFO L225 Difference]: With dead ends: 41 [2019-01-12 11:19:18,033 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 11:19:18,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:19:18,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 11:19:18,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2019-01-12 11:19:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 11:19:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-01-12 11:19:18,041 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 11 [2019-01-12 11:19:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:18,041 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-01-12 11:19:18,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:19:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-01-12 11:19:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 11:19:18,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:18,043 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:18,043 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:18,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash -272038047, now seen corresponding path program 1 times [2019-01-12 11:19:18,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:18,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:18,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:18,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:18,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:19:18,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:19:18,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:19:18,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:19:18,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:19:18,135 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 5 states. [2019-01-12 11:19:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:18,216 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2019-01-12 11:19:18,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:19:18,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-12 11:19:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:18,219 INFO L225 Difference]: With dead ends: 36 [2019-01-12 11:19:18,219 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 11:19:18,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:19:18,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 11:19:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 11:19:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 11:19:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-01-12 11:19:18,226 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 13 [2019-01-12 11:19:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:18,226 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-01-12 11:19:18,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:19:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2019-01-12 11:19:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 11:19:18,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:18,227 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:18,227 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash 55602980, now seen corresponding path program 1 times [2019-01-12 11:19:18,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:18,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:18,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:18,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:18,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:19:18,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 11:19:18,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:18,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:19:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:18,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 11:19:18,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2019-01-12 11:19:18,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:19:18,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:19:18,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:19:18,367 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 6 states. [2019-01-12 11:19:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:18,392 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-12 11:19:18,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:19:18,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-12 11:19:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:18,395 INFO L225 Difference]: With dead ends: 29 [2019-01-12 11:19:18,396 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:19:18,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-01-12 11:19:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:19:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:19:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:19:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:19:18,397 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-01-12 11:19:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:18,397 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:19:18,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:19:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:19:18,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:19:18,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:19:18,741 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-01-12 11:19:18,974 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2019-01-12 11:19:18,977 INFO L448 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2019-01-12 11:19:18,977 INFO L444 ceAbstractionStarter]: At program point L32-2(lines 32 36) the Hoare annotation is: (let ((.cse0 (<= 2000 ULTIMATE.start_main_~c2~0)) (.cse4 (<= 4000 ULTIMATE.start_main_~c1~0)) (.cse1 (<= 10000 ULTIMATE.start_main_~c3~0)) (.cse2 (<= ULTIMATE.start_main_~n~0 1)) (.cse3 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and (and (and .cse0 (<= 2000 ULTIMATE.start_main_~k~0) .cse4) .cse1) .cse2 (<= ULTIMATE.start_main_~n~0 (+ ULTIMATE.start_main_~j~0 1))) (and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~n~0 0) .cse3))) [2019-01-12 11:19:18,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:19:18,977 INFO L448 ceAbstractionStarter]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2019-01-12 11:19:18,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:19:18,979 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-01-12 11:19:18,979 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 30) no Hoare annotation was computed. [2019-01-12 11:19:18,979 INFO L451 ceAbstractionStarter]: At program point L37(lines 10 38) the Hoare annotation is: true [2019-01-12 11:19:18,979 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:19:18,979 INFO L444 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= 2000 ULTIMATE.start_main_~c2~0) (<= 10000 ULTIMATE.start_main_~c3~0) (<= ULTIMATE.start_main_~n~0 1) (<= ULTIMATE.start_main_~n~0 (+ ULTIMATE.start_main_~j~0 1)) (<= 4000 ULTIMATE.start_main_~c1~0)) [2019-01-12 11:19:18,980 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:19:18,981 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-12 11:19:18,981 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 11:19:18,981 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:19:18,982 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 29) no Hoare annotation was computed. [2019-01-12 11:19:18,982 INFO L444 ceAbstractionStarter]: At program point L26-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (<= 2000 ULTIMATE.start_main_~c2~0)) (.cse1 (<= 10000 ULTIMATE.start_main_~c3~0)) (.cse2 (<= 4000 ULTIMATE.start_main_~c1~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) (<= 0 ULTIMATE.start_main_~k~0) .cse0 .cse1 .cse2 (<= 0 ULTIMATE.start_main_~i~0)) (and (<= 1 ULTIMATE.start_main_~i~0) .cse0 .cse1 (<= 2000 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~n~0 1) .cse2))) [2019-01-12 11:19:19,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:19:19 BoogieIcfgContainer [2019-01-12 11:19:19,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:19:19,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:19:19,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:19:19,011 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:19:19,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:19:15" (3/4) ... [2019-01-12 11:19:19,018 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:19:19,034 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 11:19:19,035 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-12 11:19:19,035 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 11:19:19,097 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:19:19,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:19:19,102 INFO L168 Benchmark]: Toolchain (without parser) took 4189.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.3 MB in the beginning and 932.0 MB in the end (delta: 11.3 MB). Peak memory consumption was 151.3 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:19,103 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:19:19,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.06 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:19,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.76 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:19:19,106 INFO L168 Benchmark]: Boogie Preprocessor took 19.04 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:19,107 INFO L168 Benchmark]: RCFGBuilder took 397.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:19,108 INFO L168 Benchmark]: TraceAbstraction took 3382.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 938.7 MB in the end (delta: 172.4 MB). Peak memory consumption was 172.4 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:19,108 INFO L168 Benchmark]: Witness Printer took 89.82 ms. Allocated memory is still 1.2 GB. Free memory was 938.7 MB in the beginning and 932.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:19,118 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.06 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.76 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.04 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 397.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3382.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 938.7 MB in the end (delta: 172.4 MB). Peak memory consumption was 172.4 MB. Max. memory is 11.5 GB. * Witness Printer took 89.82 ms. Allocated memory is still 1.2 GB. Free memory was 938.7 MB in the beginning and 932.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 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: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((2000 <= c2 && 10000 <= c3) && n <= 1) && n <= j + 1) && 4000 <= c1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((i <= 0 && 0 <= k) && 2000 <= c2) && 10000 <= c3) && 4000 <= c1) && 0 <= i) || (((((1 <= i && 2000 <= c2) && 10000 <= c3) && 2000 <= k) && n <= 1) && 4000 <= c1) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((2000 <= c2 && 10000 <= c3) && n <= 1) && n <= j) && 4000 <= c1) || (((((2000 <= c2 && 2000 <= k) && 4000 <= c1) && 10000 <= c3) && n <= 1) && n <= j + 1)) || ((i <= 0 && n <= 0) && n <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. SAFE Result, 3.2s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 105 SDtfs, 128 SDslu, 142 SDs, 0 SdLazy, 179 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 13 NumberOfFragments, 109 HoareAnnotationTreeSize, 4 FomulaSimplifications, 365 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 86 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 3354 SizeOfPredicates, 13 NumberOfNonLiveVariables, 223 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 12/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...