./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/nested9_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/nested9_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 041ac1710be6e1a9f4a6c44510c9851574d3d115 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:33,703 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:19:33,705 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:19:33,717 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:19:33,717 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:19:33,718 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:19:33,720 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:19:33,721 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:19:33,723 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:19:33,724 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:19:33,725 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:19:33,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:19:33,726 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:19:33,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:19:33,728 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:19:33,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:19:33,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:19:33,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:19:33,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:19:33,735 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:19:33,736 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:19:33,737 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:19:33,740 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:19:33,740 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:19:33,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:19:33,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:19:33,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:19:33,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:19:33,744 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:19:33,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:19:33,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:19:33,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:19:33,746 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:19:33,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:19:33,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:19:33,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:19:33,748 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:33,772 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:19:33,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:19:33,774 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:19:33,774 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:19:33,774 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:19:33,774 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:19:33,775 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:19:33,775 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:19:33,775 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:19:33,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:19:33,775 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:19:33,775 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:19:33,776 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:19:33,776 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:19:33,776 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:19:33,776 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:19:33,776 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:19:33,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:19:33,777 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:19:33,777 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:19:33,777 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:19:33,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:19:33,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:19:33,778 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:19:33,778 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:19:33,778 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:19:33,778 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:19:33,778 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:19:33,778 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 -> 041ac1710be6e1a9f4a6c44510c9851574d3d115 [2019-01-12 11:19:33,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:19:33,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:19:33,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:19:33,829 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:19:33,830 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:19:33,831 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/nested9_true-unreach-call_true-termination.i [2019-01-12 11:19:33,886 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91949379/1c819dd41ac9435ba76d14e3de9b2b13/FLAG6352ad405 [2019-01-12 11:19:34,292 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:19:34,293 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/nested9_true-unreach-call_true-termination.i [2019-01-12 11:19:34,299 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91949379/1c819dd41ac9435ba76d14e3de9b2b13/FLAG6352ad405 [2019-01-12 11:19:34,671 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f91949379/1c819dd41ac9435ba76d14e3de9b2b13 [2019-01-12 11:19:34,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:19:34,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:19:34,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:19:34,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:19:34,685 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:19:34,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:19:34" (1/1) ... [2019-01-12 11:19:34,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545503fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:34, skipping insertion in model container [2019-01-12 11:19:34,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:19:34" (1/1) ... [2019-01-12 11:19:34,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:19:34,718 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:19:34,907 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:19:34,913 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:19:34,934 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:19:34,949 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:19:34,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:34 WrapperNode [2019-01-12 11:19:34,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:19:34,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:19:34,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:19:34,951 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:19:34,961 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:34" (1/1) ... [2019-01-12 11:19:34,967 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:34" (1/1) ... [2019-01-12 11:19:34,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:19:34,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:19:34,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:19:34,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:19:35,001 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:34" (1/1) ... [2019-01-12 11:19:35,001 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:34" (1/1) ... [2019-01-12 11:19:35,002 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:34" (1/1) ... [2019-01-12 11:19:35,003 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:34" (1/1) ... [2019-01-12 11:19:35,006 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:34" (1/1) ... [2019-01-12 11:19:35,012 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:34" (1/1) ... [2019-01-12 11:19:35,013 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:34" (1/1) ... [2019-01-12 11:19:35,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:19:35,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:19:35,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:19:35,016 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:19:35,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:34" (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:35,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:19:35,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:19:35,563 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:19:35,563 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 11:19:35,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:19:35 BoogieIcfgContainer [2019-01-12 11:19:35,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:19:35,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:19:35,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:19:35,569 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:19:35,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:19:34" (1/3) ... [2019-01-12 11:19:35,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe021c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:19:35, skipping insertion in model container [2019-01-12 11:19:35,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:34" (2/3) ... [2019-01-12 11:19:35,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe021c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:19:35, skipping insertion in model container [2019-01-12 11:19:35,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:19:35" (3/3) ... [2019-01-12 11:19:35,573 INFO L112 eAbstractionObserver]: Analyzing ICFG nested9_true-unreach-call_true-termination.i [2019-01-12 11:19:35,584 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:19:35,592 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 11:19:35,608 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 11:19:35,638 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:19:35,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:19:35,639 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:19:35,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:19:35,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:19:35,639 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:19:35,639 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:19:35,640 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:19:35,640 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:19:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-01-12 11:19:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 11:19:35,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:35,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:35,665 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:35,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:35,671 INFO L82 PathProgramCache]: Analyzing trace with hash -331449283, now seen corresponding path program 1 times [2019-01-12 11:19:35,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:35,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:35,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:35,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:35,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:35,865 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:35,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:19:35,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:19:35,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:19:35,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:19:35,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:19:35,885 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2019-01-12 11:19:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:36,044 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2019-01-12 11:19:36,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:19:36,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-12 11:19:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:36,055 INFO L225 Difference]: With dead ends: 40 [2019-01-12 11:19:36,055 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 11:19:36,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:19:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 11:19:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-01-12 11:19:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-12 11:19:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-01-12 11:19:36,088 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2019-01-12 11:19:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:36,088 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-01-12 11:19:36,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:19:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-01-12 11:19:36,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 11:19:36,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:36,090 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:36,090 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:36,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:36,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1296087111, now seen corresponding path program 1 times [2019-01-12 11:19:36,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:36,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:36,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:36,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:36,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:36,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:19:36,229 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:36,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:36,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:19:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:36,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 11:19:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2019-01-12 11:19:36,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:19:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:19:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:19:36,725 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 9 states. [2019-01-12 11:19:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:37,250 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2019-01-12 11:19:37,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 11:19:37,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-12 11:19:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:37,252 INFO L225 Difference]: With dead ends: 43 [2019-01-12 11:19:37,252 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 11:19:37,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2019-01-12 11:19:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 11:19:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 20. [2019-01-12 11:19:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 11:19:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-01-12 11:19:37,260 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2019-01-12 11:19:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:37,261 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-12 11:19:37,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:19:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-01-12 11:19:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 11:19:37,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:37,262 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:37,263 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:37,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:37,263 INFO L82 PathProgramCache]: Analyzing trace with hash 29741143, now seen corresponding path program 1 times [2019-01-12 11:19:37,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:37,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:37,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:37,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:37,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:19:37,404 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:37,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:37,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:19:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 11:19:37,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:19:37,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-01-12 11:19:37,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 11:19:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 11:19:37,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-12 11:19:37,831 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 10 states. [2019-01-12 11:19:38,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:38,215 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-01-12 11:19:38,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 11:19:38,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-12 11:19:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:38,217 INFO L225 Difference]: With dead ends: 45 [2019-01-12 11:19:38,218 INFO L226 Difference]: Without dead ends: 34 [2019-01-12 11:19:38,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:19:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-12 11:19:38,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2019-01-12 11:19:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 11:19:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2019-01-12 11:19:38,228 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2019-01-12 11:19:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:38,228 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2019-01-12 11:19:38,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 11:19:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2019-01-12 11:19:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-12 11:19:38,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:38,230 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:38,230 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:38,230 INFO L82 PathProgramCache]: Analyzing trace with hash 48602575, now seen corresponding path program 1 times [2019-01-12 11:19:38,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:38,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:38,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:38,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:38,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 11:19:38,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:19:38,335 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:38,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:38,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:19:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-12 11:19:38,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 11:19:38,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-01-12 11:19:38,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:19:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:19:38,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:19:38,473 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 9 states. [2019-01-12 11:19:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:38,706 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-01-12 11:19:38,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:19:38,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-01-12 11:19:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:38,709 INFO L225 Difference]: With dead ends: 51 [2019-01-12 11:19:38,709 INFO L226 Difference]: Without dead ends: 31 [2019-01-12 11:19:38,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:19:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-12 11:19:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-01-12 11:19:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 11:19:38,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-01-12 11:19:38,721 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 24 [2019-01-12 11:19:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:38,721 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-01-12 11:19:38,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:19:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-01-12 11:19:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 11:19:38,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:38,724 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:38,724 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:38,724 INFO L82 PathProgramCache]: Analyzing trace with hash 67888881, now seen corresponding path program 2 times [2019-01-12 11:19:38,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:38,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:38,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:38,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:38,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 11:19:39,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:19:39,072 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:39,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 11:19:39,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-12 11:19:39,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 11:19:39,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:19:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-12 11:19:39,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:19:39,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-01-12 11:19:39,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 11:19:39,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 11:19:39,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-12 11:19:39,193 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 13 states. [2019-01-12 11:19:39,959 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-01-12 11:19:40,286 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-01-12 11:19:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:40,401 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2019-01-12 11:19:40,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 11:19:40,402 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2019-01-12 11:19:40,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:40,403 INFO L225 Difference]: With dead ends: 42 [2019-01-12 11:19:40,403 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:19:40,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-01-12 11:19:40,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:19:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:19:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:19:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:19:40,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2019-01-12 11:19:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:40,406 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:19:40,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 11:19:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:19:40,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:19:40,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:19:40,696 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 18 [2019-01-12 11:19:40,953 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2019-01-12 11:19:41,333 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-12 11:19:41,337 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-01-12 11:19:41,337 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-01-12 11:19:41,337 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 11:19:41,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:19:41,337 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:19:41,338 INFO L451 ceAbstractionStarter]: At program point L24(lines 11 26) the Hoare annotation is: true [2019-01-12 11:19:41,338 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2019-01-12 11:19:41,338 INFO L444 ceAbstractionStarter]: At program point L20-3(lines 20 23) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 1) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0))) (and (<= ULTIMATE.start_main_~i~0 0) (<= 0 ULTIMATE.start_main_~i~0)) (and (<= 2 ULTIMATE.start_main_~i~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond))) [2019-01-12 11:19:41,338 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-01-12 11:19:41,338 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:19:41,339 INFO L444 ceAbstractionStarter]: At program point L4-2(lines 1 26) the Hoare annotation is: (let ((.cse4 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse0 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse2 (<= .cse4 ULTIMATE.start_main_~j~0)) (.cse3 (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))) (or (let ((.cse1 (* 3 ULTIMATE.start_main_~i~0))) (and (<= 2 ULTIMATE.start_main_~i~0) .cse0 (and (<= (+ ULTIMATE.start_main_~k~0 2) .cse1) .cse2) (< ULTIMATE.start_main_~j~0 .cse1) .cse3)) (and (exists ((ULTIMATE.start_main_~i~0 Int)) (and (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 1) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))) (exists ((ULTIMATE.start_main_~i~0 Int)) (and (<= 1 ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~i~0) (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0))) .cse0 .cse2 .cse3 (<= ULTIMATE.start_main_~j~0 .cse4))))) [2019-01-12 11:19:41,339 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:19:41,339 INFO L451 ceAbstractionStarter]: At program point L25(lines 11 26) the Hoare annotation is: true [2019-01-12 11:19:41,339 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2019-01-12 11:19:41,339 INFO L444 ceAbstractionStarter]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse4 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse1 (<= .cse4 ULTIMATE.start_main_~j~0)) (.cse0 (* 3 ULTIMATE.start_main_~i~0)) (.cse2 (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))) (or (and (<= ULTIMATE.start_main_~i~0 1) (< ULTIMATE.start_main_~j~0 .cse0) .cse1 .cse2) (and (<= 2 ULTIMATE.start_main_~i~0) .cse3 .cse1 .cse2) (and (<= 1 ULTIMATE.start_main_~i~0) .cse3 (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~k~0 1)) .cse1 .cse2) (and (<= .cse0 ULTIMATE.start_main_~j~0) .cse2 (<= ULTIMATE.start_main_~j~0 .cse4) (<= 0 ULTIMATE.start_main_~i~0))))) [2019-01-12 11:19:41,339 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-12 11:19:41,340 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 11:19:41,340 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:19:41,340 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 23) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse0 (< ULTIMATE.start_main_~j~0 (* 3 ULTIMATE.start_main_~i~0))) (.cse1 (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0)) (.cse2 (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))) (or (and (exists ((ULTIMATE.start_main_~i~0 Int)) (and (<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 1) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~i~0) .cse0 .cse1 .cse2) (and .cse3 (exists ((ULTIMATE.start_main_~i~0 Int)) (and (<= (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~k~0) (<= ULTIMATE.start_main_~i~0 1) (<= ULTIMATE.start_main_~j~0 (* 2 ULTIMATE.start_main_~i~0)))) .cse0 .cse1 .cse2) (and (<= 2 ULTIMATE.start_main_~i~0) .cse3 .cse0 .cse1 .cse2))) [2019-01-12 11:19:41,340 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-01-12 11:19:41,355 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,357 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,358 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,359 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,360 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:19:41 BoogieIcfgContainer [2019-01-12 11:19:41,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:19:41,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:19:41,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:19:41,371 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:19:41,372 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:35" (3/4) ... [2019-01-12 11:19:41,376 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:19:41,387 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 11:19:41,387 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:19:41,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0) && k <= i) && j < 3 * i) && 2 * i <= j) && i < n) || ((((1 == cond && (\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 + 1 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0)) && j < 3 * i) && 2 * i <= j) && i < n)) || ((((2 <= i && 1 == cond) && j < 3 * i) && 2 * i <= j) && i < n) [2019-01-12 11:19:41,412 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 <= i && 1 == cond) && k + 2 <= 3 * i && 2 * i <= j) && j < 3 * i) && i < n) || ((((((\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0) && (\exists ULTIMATE.start_main_~i~0 : int :: (1 <= ULTIMATE.start_main_~i~0 && k <= ULTIMATE.start_main_~i~0) && 2 * ULTIMATE.start_main_~i~0 <= j)) && 1 == cond) && 2 * i <= j) && i < n) && j <= 2 * i) [2019-01-12 11:19:41,471 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:19:41,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:19:41,472 INFO L168 Benchmark]: Toolchain (without parser) took 6797.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.2 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -246.9 MB). Peak memory consumption was 290.3 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:41,474 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:19:41,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.86 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.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:41,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.29 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:19:41,477 INFO L168 Benchmark]: Boogie Preprocessor took 24.51 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.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:41,477 INFO L168 Benchmark]: RCFGBuilder took 549.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:41,478 INFO L168 Benchmark]: TraceAbstraction took 5804.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 810.3 MB in the end (delta: 303.7 MB). Peak memory consumption was 303.7 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:41,479 INFO L168 Benchmark]: Witness Printer took 101.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 810.3 MB in the beginning and 1.2 GB in the end (delta: -387.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:41,483 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.86 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.51 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 549.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5804.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 810.3 MB in the end (delta: 303.7 MB). Peak memory consumption was 303.7 MB. Max. memory is 11.5 GB. * Witness Printer took 101.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 810.3 MB in the beginning and 1.2 GB in the end (delta: -387.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] * 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: (((1 <= i && i <= 1) && j <= 2 * i) || (i <= 0 && 0 <= i)) || (2 <= i && 1 == cond) - InvariantResult [Line: 1]: Loop Invariant [2019-01-12 11:19:41,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,493 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] Derived loop invariant: ((((2 <= i && 1 == cond) && k + 2 <= 3 * i && 2 * i <= j) && j < 3 * i) && i < n) || ((((((\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0) && (\exists ULTIMATE.start_main_~i~0 : int :: (1 <= ULTIMATE.start_main_~i~0 && k <= ULTIMATE.start_main_~i~0) && 2 * ULTIMATE.start_main_~i~0 <= j)) && 1 == cond) && 2 * i <= j) && i < n) && j <= 2 * i) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((i <= 1 && j < 3 * i) && 2 * i <= j) && i < n) || (((2 <= i && 1 == cond) && 2 * i <= j) && i < n)) || ((((1 <= i && 1 == cond) && j <= k + 1) && 2 * i <= j) && i < n)) || (((3 * i <= j && i < n) && j <= 2 * i) && 0 <= i) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2019-01-12 11:19:41,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,495 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,496 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] [2019-01-12 11:19:41,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~i~0,QUANTIFIED] Derived loop invariant: ((((((\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0) && k <= i) && j < 3 * i) && 2 * i <= j) && i < n) || ((((1 == cond && (\exists ULTIMATE.start_main_~i~0 : int :: (ULTIMATE.start_main_~i~0 + 1 <= k && ULTIMATE.start_main_~i~0 <= 1) && j <= 2 * ULTIMATE.start_main_~i~0)) && j < 3 * i) && 2 * i <= j) && i < n)) || ((((2 <= i && 1 == cond) && j < 3 * i) && 2 * i <= j) && i < n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 67 SDtfs, 168 SDslu, 187 SDs, 0 SdLazy, 371 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=4, 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, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 32 NumberOfFragments, 254 HoareAnnotationTreeSize, 6 FomulaSimplifications, 1713 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 298 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 180 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 171 ConstructedInterpolants, 5 QuantifiedInterpolants, 9831 SizeOfPredicates, 17 NumberOfNonLiveVariables, 202 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 60/80 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...