./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/nested6_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/nested6_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 934ee9c856a834ce808d29dea79c6912619f897f ......................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:26,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:19:26,232 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:19:26,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:19:26,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:19:26,246 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:19:26,248 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:19:26,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:19:26,252 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:19:26,253 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:19:26,254 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:19:26,254 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:19:26,255 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:19:26,256 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:19:26,258 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:19:26,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:19:26,259 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:19:26,262 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:19:26,264 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:19:26,266 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:19:26,267 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:19:26,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:19:26,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:19:26,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:19:26,272 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:19:26,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:19:26,275 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:19:26,275 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:19:26,277 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:19:26,278 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:19:26,278 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:19:26,279 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:19:26,280 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:19:26,280 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:19:26,281 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:19:26,282 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:19:26,282 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:26,313 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:19:26,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:19:26,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:19:26,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:19:26,316 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:19:26,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:19:26,318 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:19:26,318 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:19:26,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:19:26,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:19:26,318 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:19:26,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:19:26,320 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:19:26,320 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:19:26,320 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:19:26,320 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:19:26,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:19:26,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:19:26,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:19:26,323 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:19:26,323 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:19:26,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:19:26,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:19:26,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:19:26,325 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:19:26,325 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:19:26,325 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:19:26,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:19:26,325 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 -> 934ee9c856a834ce808d29dea79c6912619f897f [2019-01-12 11:19:26,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:19:26,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:19:26,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:19:26,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:19:26,415 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:19:26,416 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2019-01-12 11:19:26,478 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090dc5804/00c719cc368240c9add66444f75a6abf/FLAG95df08044 [2019-01-12 11:19:26,891 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:19:26,891 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2019-01-12 11:19:26,898 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090dc5804/00c719cc368240c9add66444f75a6abf/FLAG95df08044 [2019-01-12 11:19:27,270 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090dc5804/00c719cc368240c9add66444f75a6abf [2019-01-12 11:19:27,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:19:27,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:19:27,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:19:27,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:19:27,279 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:19:27,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:19:27" (1/1) ... [2019-01-12 11:19:27,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8f157c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:27, skipping insertion in model container [2019-01-12 11:19:27,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:19:27" (1/1) ... [2019-01-12 11:19:27,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:19:27,308 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:19:27,519 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:19:27,528 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:19:27,553 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:19:27,570 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:19:27,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:27 WrapperNode [2019-01-12 11:19:27,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:19:27,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:19:27,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:19:27,573 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:19:27,582 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:27" (1/1) ... [2019-01-12 11:19:27,587 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:27" (1/1) ... [2019-01-12 11:19:27,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:19:27,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:19:27,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:19:27,617 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:19:27,627 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:27" (1/1) ... [2019-01-12 11:19:27,628 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:27" (1/1) ... [2019-01-12 11:19:27,629 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:27" (1/1) ... [2019-01-12 11:19:27,630 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:27" (1/1) ... [2019-01-12 11:19:27,633 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:27" (1/1) ... [2019-01-12 11:19:27,641 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:27" (1/1) ... [2019-01-12 11:19:27,644 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:27" (1/1) ... [2019-01-12 11:19:27,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:19:27,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:19:27,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:19:27,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:19:27,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:27" (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:27,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:19:27,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:19:28,147 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:19:28,147 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-12 11:19:28,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:19:28 BoogieIcfgContainer [2019-01-12 11:19:28,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:19:28,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:19:28,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:19:28,152 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:19:28,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:19:27" (1/3) ... [2019-01-12 11:19:28,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae7b2eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:19:28, skipping insertion in model container [2019-01-12 11:19:28,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:19:27" (2/3) ... [2019-01-12 11:19:28,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae7b2eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:19:28, skipping insertion in model container [2019-01-12 11:19:28,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:19:28" (3/3) ... [2019-01-12 11:19:28,155 INFO L112 eAbstractionObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2019-01-12 11:19:28,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:19:28,172 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-12 11:19:28,189 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-12 11:19:28,219 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:19:28,220 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:19:28,220 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:19:28,221 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:19:28,221 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:19:28,221 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:19:28,221 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:19:28,221 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:19:28,221 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:19:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-01-12 11:19:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 11:19:28,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:28,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:28,247 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:28,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash -346948471, now seen corresponding path program 1 times [2019-01-12 11:19:28,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:28,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:28,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:28,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:28,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:28,408 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:28,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:19:28,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 11:19:28,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 11:19:28,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 11:19:28,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 11:19:28,430 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-01-12 11:19:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:28,581 INFO L93 Difference]: Finished difference Result 48 states and 67 transitions. [2019-01-12 11:19:28,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 11:19:28,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-12 11:19:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:28,592 INFO L225 Difference]: With dead ends: 48 [2019-01-12 11:19:28,592 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 11:19:28,596 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:28,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 11:19:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-12 11:19:28,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-12 11:19:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-12 11:19:28,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2019-01-12 11:19:28,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:28,630 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-12 11:19:28,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 11:19:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-01-12 11:19:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:19:28,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:28,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:28,631 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:28,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:28,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734748, now seen corresponding path program 1 times [2019-01-12 11:19:28,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:28,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:28,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:28,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:28,740 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:28,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:19:28,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:19:28,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:19:28,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:19:28,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:19:28,744 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-01-12 11:19:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:29,206 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-01-12 11:19:29,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:19:29,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-12 11:19:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:29,208 INFO L225 Difference]: With dead ends: 37 [2019-01-12 11:19:29,208 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 11:19:29,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:19:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 11:19:29,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2019-01-12 11:19:29,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 11:19:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-12 11:19:29,217 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2019-01-12 11:19:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:29,218 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-12 11:19:29,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:19:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-01-12 11:19:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 11:19:29,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:29,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:29,220 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:29,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1590125452, now seen corresponding path program 1 times [2019-01-12 11:19:29,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:29,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:29,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:29,339 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:29,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:19:29,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:19:29,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:19:29,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:19:29,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:19:29,341 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 6 states. [2019-01-12 11:19:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:29,630 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-01-12 11:19:29,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:19:29,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-01-12 11:19:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:29,632 INFO L225 Difference]: With dead ends: 37 [2019-01-12 11:19:29,632 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 11:19:29,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:19:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 11:19:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-01-12 11:19:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-12 11:19:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-01-12 11:19:29,643 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 11 [2019-01-12 11:19:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:29,644 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-01-12 11:19:29,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:19:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-01-12 11:19:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 11:19:29,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:29,645 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:29,645 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash -520059879, now seen corresponding path program 1 times [2019-01-12 11:19:29,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:29,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:29,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:29,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:29,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:29,840 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:29,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:19:29,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 11:19:29,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 11:19:29,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 11:19:29,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:19:29,843 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 7 states. [2019-01-12 11:19:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:30,413 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2019-01-12 11:19:30,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 11:19:30,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-01-12 11:19:30,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:30,415 INFO L225 Difference]: With dead ends: 71 [2019-01-12 11:19:30,416 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 11:19:30,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-01-12 11:19:30,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 11:19:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 28. [2019-01-12 11:19:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 11:19:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-01-12 11:19:30,426 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 15 [2019-01-12 11:19:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:30,427 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-01-12 11:19:30,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 11:19:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-01-12 11:19:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 11:19:30,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:19:30,428 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:19:30,428 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:19:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:19:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash -834677719, now seen corresponding path program 1 times [2019-01-12 11:19:30,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:19:30,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:19:30,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:30,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:19:30,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:19:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:19:30,512 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:30,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:19:30,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:19:30,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:19:30,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:19:30,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:19:30,514 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 6 states. [2019-01-12 11:19:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:19:30,690 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-01-12 11:19:30,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 11:19:30,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-12 11:19:30,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:19:30,691 INFO L225 Difference]: With dead ends: 30 [2019-01-12 11:19:30,692 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:19:30,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:19:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:19:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:19:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:19:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:19:30,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-01-12 11:19:30,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:19:30,693 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:19:30,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:19:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:19:30,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:19:30,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:19:30,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:19:30,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 11:19:31,118 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2019-01-12 11:19:31,118 INFO L444 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0)) (.cse1 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))) (or (and .cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) .cse1) (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1))) [2019-01-12 11:19:31,118 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-01-12 11:19:31,119 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2019-01-12 11:19:31,119 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:19:31,119 INFO L451 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-01-12 11:19:31,119 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:19:31,119 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:19:31,120 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0)) (.cse1 (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0)) (.cse2 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0) .cse0 .cse1 .cse2) (and .cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) .cse1 .cse2))) [2019-01-12 11:19:31,120 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:19:31,120 INFO L444 ceAbstractionStarter]: At program point L4-2(lines 1 34) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start_main_~i~0))) (and (<= (+ ULTIMATE.start_main_~k~0 1) ULTIMATE.start_main_~n~0) (<= .cse0 ULTIMATE.start_main_~k~0) (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= .cse0 ULTIMATE.start_main_~j~0))) [2019-01-12 11:19:31,120 INFO L448 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:19:31,120 INFO L451 ceAbstractionStarter]: At program point L33(lines 10 34) the Hoare annotation is: true [2019-01-12 11:19:31,120 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:19:31,121 INFO L444 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0)) [2019-01-12 11:19:31,121 INFO L448 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:19:31,121 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:19:31,121 INFO L444 ceAbstractionStarter]: At program point L4-8(lines 1 34) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0)) [2019-01-12 11:19:31,121 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-01-12 11:19:31,121 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 11:19:31,121 INFO L448 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-01-12 11:19:31,122 INFO L448 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-01-12 11:19:31,122 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse3 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse0 (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~n~0)) (.cse1 (<= .cse3 ULTIMATE.start_main_~k~0)) (.cse2 (<= .cse3 ULTIMATE.start_main_~j~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) (<= (+ ULTIMATE.start_main_~k~0 1) ULTIMATE.start_main_~n~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) .cse2)))) [2019-01-12 11:19:31,122 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-01-12 11:19:31,122 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:19:31,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:19:31 BoogieIcfgContainer [2019-01-12 11:19:31,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:19:31,141 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:19:31,141 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:19:31,145 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:19:31,146 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:28" (3/4) ... [2019-01-12 11:19:31,149 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:19:31,159 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-12 11:19:31,159 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:19:31,221 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:19:31,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:19:31,225 INFO L168 Benchmark]: Toolchain (without parser) took 3952.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 951.4 MB in the beginning and 940.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 129.0 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:31,227 INFO L168 Benchmark]: CDTParser took 0.15 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:31,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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:31,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.75 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:31,228 INFO L168 Benchmark]: Boogie Preprocessor took 36.00 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 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:31,229 INFO L168 Benchmark]: RCFGBuilder took 495.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:31,230 INFO L168 Benchmark]: TraceAbstraction took 2991.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 940.8 MB in the end (delta: 151.9 MB). Peak memory consumption was 151.9 MB. Max. memory is 11.5 GB. [2019-01-12 11:19:31,230 INFO L168 Benchmark]: Witness Printer took 83.32 ms. Allocated memory is still 1.1 GB. Free memory is still 940.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:19:31,234 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.15 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 296.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 43.75 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 36.00 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 495.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -157.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2991.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 940.8 MB in the end (delta: 151.9 MB). Peak memory consumption was 151.9 MB. Max. memory is 11.5 GB. * Witness Printer took 83.32 ms. Allocated memory is still 1.1 GB. Free memory is still 940.8 MB. There was no memory consumed. 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 - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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 3 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((j + 1 <= n && k <= n) && cond == 1) && 2 * i <= j) && n <= k - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((k <= n && !(0 == cond)) && n <= k) || ((i <= 0 && k <= n) && n <= k) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((j + 1 <= n && k <= n) && !(0 == cond)) && 2 * i <= j) && n <= k - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((k + 1 <= n && 2 * i <= k) && j + 1 <= n) && cond == 1) && 2 * i <= j - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((i <= 0 && j + 1 <= n) && k <= n) && 2 * i <= j) && n <= k) || (((k <= n && !(0 == cond)) && 2 * i <= j) && n <= k) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((i <= 0 && k + 1 <= n) && j + 1 <= n) && 2 * i <= k) && 2 * i <= j) || ((((j + 1 <= n && 2 * i <= k) && k <= n) && !(0 == cond)) && 2 * i <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 3 error locations. SAFE Result, 2.9s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 79 SDtfs, 125 SDslu, 103 SDs, 0 SdLazy, 277 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 50 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 26 NumberOfFragments, 175 HoareAnnotationTreeSize, 8 FomulaSimplifications, 1689 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 61 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 2219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...