./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_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/apache-escape-absolute_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 3607a70e53f56c4b4860f9fca9676a925474c3df .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:17:38,371 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 11:17:38,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 11:17:38,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 11:17:38,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 11:17:38,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 11:17:38,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 11:17:38,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 11:17:38,406 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 11:17:38,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 11:17:38,407 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 11:17:38,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 11:17:38,409 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 11:17:38,410 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 11:17:38,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 11:17:38,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 11:17:38,412 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 11:17:38,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 11:17:38,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 11:17:38,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 11:17:38,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 11:17:38,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 11:17:38,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 11:17:38,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 11:17:38,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 11:17:38,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 11:17:38,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 11:17:38,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 11:17:38,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 11:17:38,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 11:17:38,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 11:17:38,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 11:17:38,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 11:17:38,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 11:17:38,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 11:17:38,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 11:17:38,430 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:17:38,444 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 11:17:38,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 11:17:38,446 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 11:17:38,446 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 11:17:38,446 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 11:17:38,447 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 11:17:38,447 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 11:17:38,447 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 11:17:38,447 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 11:17:38,447 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 11:17:38,447 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 11:17:38,448 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 11:17:38,448 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 11:17:38,448 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 11:17:38,448 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 11:17:38,448 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 11:17:38,448 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 11:17:38,449 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 11:17:38,449 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 11:17:38,449 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 11:17:38,449 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 11:17:38,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 11:17:38,449 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 11:17:38,450 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 11:17:38,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 11:17:38,450 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 11:17:38,450 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 11:17:38,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 11:17:38,450 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 -> 3607a70e53f56c4b4860f9fca9676a925474c3df [2019-01-12 11:17:38,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 11:17:38,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 11:17:38,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 11:17:38,530 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 11:17:38,530 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 11:17:38,532 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2019-01-12 11:17:38,595 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff7137c3/9f2289aab1fb4eb7b0b72ecb05e62917/FLAG9bc6b7d69 [2019-01-12 11:17:39,061 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 11:17:39,061 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2019-01-12 11:17:39,067 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff7137c3/9f2289aab1fb4eb7b0b72ecb05e62917/FLAG9bc6b7d69 [2019-01-12 11:17:39,436 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff7137c3/9f2289aab1fb4eb7b0b72ecb05e62917 [2019-01-12 11:17:39,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 11:17:39,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 11:17:39,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 11:17:39,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 11:17:39,449 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 11:17:39,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:17:39" (1/1) ... [2019-01-12 11:17:39,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bbaf52b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39, skipping insertion in model container [2019-01-12 11:17:39,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 11:17:39" (1/1) ... [2019-01-12 11:17:39,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 11:17:39,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 11:17:39,683 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:17:39,692 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 11:17:39,735 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 11:17:39,758 INFO L195 MainTranslator]: Completed translation [2019-01-12 11:17:39,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39 WrapperNode [2019-01-12 11:17:39,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 11:17:39,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 11:17:39,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 11:17:39,762 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 11:17:39,775 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:17:39" (1/1) ... [2019-01-12 11:17:39,783 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:17:39" (1/1) ... [2019-01-12 11:17:39,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 11:17:39,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 11:17:39,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 11:17:39,844 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 11:17:39,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39" (1/1) ... [2019-01-12 11:17:39,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39" (1/1) ... [2019-01-12 11:17:39,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39" (1/1) ... [2019-01-12 11:17:39,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39" (1/1) ... [2019-01-12 11:17:39,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39" (1/1) ... [2019-01-12 11:17:39,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39" (1/1) ... [2019-01-12 11:17:39,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39" (1/1) ... [2019-01-12 11:17:39,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 11:17:39,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 11:17:39,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 11:17:39,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 11:17:39,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39" (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:17:40,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 11:17:40,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 11:17:40,900 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 11:17:40,900 INFO L286 CfgBuilder]: Removed 42 assue(true) statements. [2019-01-12 11:17:40,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:17:40 BoogieIcfgContainer [2019-01-12 11:17:40,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 11:17:40,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 11:17:40,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 11:17:40,906 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 11:17:40,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 11:17:39" (1/3) ... [2019-01-12 11:17:40,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a937c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:17:40, skipping insertion in model container [2019-01-12 11:17:40,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 11:17:39" (2/3) ... [2019-01-12 11:17:40,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a937c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 11:17:40, skipping insertion in model container [2019-01-12 11:17:40,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:17:40" (3/3) ... [2019-01-12 11:17:40,909 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call_true-termination.i [2019-01-12 11:17:40,920 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 11:17:40,928 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-01-12 11:17:40,943 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-01-12 11:17:40,976 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 11:17:40,977 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 11:17:40,977 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 11:17:40,977 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 11:17:40,978 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 11:17:40,978 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 11:17:40,978 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 11:17:40,979 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 11:17:40,979 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 11:17:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-01-12 11:17:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 11:17:41,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:17:41,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:17:41,010 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:17:41,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:17:41,016 INFO L82 PathProgramCache]: Analyzing trace with hash -374051301, now seen corresponding path program 1 times [2019-01-12 11:17:41,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:17:41,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:17:41,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:41,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:41,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:41,178 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:17:41,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:17:41,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:17:41,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:17:41,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:17:41,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:17:41,198 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2019-01-12 11:17:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:17:41,667 INFO L93 Difference]: Finished difference Result 167 states and 227 transitions. [2019-01-12 11:17:41,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:17:41,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-12 11:17:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:17:41,681 INFO L225 Difference]: With dead ends: 167 [2019-01-12 11:17:41,681 INFO L226 Difference]: Without dead ends: 83 [2019-01-12 11:17:41,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:17:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-12 11:17:41,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-12 11:17:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-12 11:17:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-01-12 11:17:41,728 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 10 [2019-01-12 11:17:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:17:41,728 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-01-12 11:17:41,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:17:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-01-12 11:17:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 11:17:41,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:17:41,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:17:41,730 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:17:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:17:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1314109022, now seen corresponding path program 1 times [2019-01-12 11:17:41,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:17:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:17:41,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:41,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:41,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:41,900 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:17:41,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:17:41,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:17:41,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:17:41,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:17:41,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:17:41,904 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 6 states. [2019-01-12 11:17:42,091 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-12 11:17:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:17:42,636 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-01-12 11:17:42,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 11:17:42,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-12 11:17:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:17:42,638 INFO L225 Difference]: With dead ends: 83 [2019-01-12 11:17:42,639 INFO L226 Difference]: Without dead ends: 67 [2019-01-12 11:17:42,640 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:17:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-12 11:17:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-12 11:17:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-12 11:17:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-01-12 11:17:42,650 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 12 [2019-01-12 11:17:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:17:42,651 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-01-12 11:17:42,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:17:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-01-12 11:17:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 11:17:42,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:17:42,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:17:42,653 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:17:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:17:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash -168637, now seen corresponding path program 1 times [2019-01-12 11:17:42,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:17:42,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:17:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:42,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:42,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:42,751 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:17:42,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:17:42,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:17:42,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:17:42,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:17:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:17:42,753 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 5 states. [2019-01-12 11:17:43,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:17:43,249 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2019-01-12 11:17:43,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:17:43,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-12 11:17:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:17:43,255 INFO L225 Difference]: With dead ends: 89 [2019-01-12 11:17:43,255 INFO L226 Difference]: Without dead ends: 81 [2019-01-12 11:17:43,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 11:17:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-12 11:17:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2019-01-12 11:17:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-12 11:17:43,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-01-12 11:17:43,267 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 15 [2019-01-12 11:17:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:17:43,267 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-01-12 11:17:43,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:17:43,268 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-01-12 11:17:43,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 11:17:43,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:17:43,269 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:17:43,270 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:17:43,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:17:43,270 INFO L82 PathProgramCache]: Analyzing trace with hash -749433183, now seen corresponding path program 1 times [2019-01-12 11:17:43,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:17:43,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:17:43,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:43,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:43,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:17:43,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 11:17:43,456 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:17:43,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:43,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 11:17:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-12 11:17:43,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 11:17:43,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-01-12 11:17:43,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 11:17:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 11:17:43,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 11:17:43,663 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 9 states. [2019-01-12 11:17:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:17:44,024 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2019-01-12 11:17:44,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:17:44,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-01-12 11:17:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:17:44,027 INFO L225 Difference]: With dead ends: 80 [2019-01-12 11:17:44,027 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 11:17:44,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 11:17:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 11:17:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2019-01-12 11:17:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 11:17:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2019-01-12 11:17:44,037 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 26 [2019-01-12 11:17:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:17:44,038 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2019-01-12 11:17:44,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 11:17:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2019-01-12 11:17:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 11:17:44,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:17:44,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:17:44,040 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:17:44,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:17:44,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1520484215, now seen corresponding path program 1 times [2019-01-12 11:17:44,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:17:44,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:17:44,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:44,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:44,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:44,172 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:17:44,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:17:44,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 11:17:44,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 11:17:44,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 11:17:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:17:44,175 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2019-01-12 11:17:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:17:44,326 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2019-01-12 11:17:44,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 11:17:44,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-01-12 11:17:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:17:44,328 INFO L225 Difference]: With dead ends: 84 [2019-01-12 11:17:44,329 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 11:17:44,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 11:17:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 11:17:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 11:17:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 11:17:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-01-12 11:17:44,339 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 38 [2019-01-12 11:17:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:17:44,339 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-01-12 11:17:44,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 11:17:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-01-12 11:17:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 11:17:44,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:17:44,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:17:44,342 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:17:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:17:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash 550411780, now seen corresponding path program 1 times [2019-01-12 11:17:44,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:17:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:17:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:44,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:44,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:44,455 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:17:44,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:17:44,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 11:17:44,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 11:17:44,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 11:17:44,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 11:17:44,458 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2019-01-12 11:17:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:17:44,628 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2019-01-12 11:17:44,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 11:17:44,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-01-12 11:17:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:17:44,631 INFO L225 Difference]: With dead ends: 55 [2019-01-12 11:17:44,632 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 11:17:44,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 11:17:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 11:17:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-01-12 11:17:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-12 11:17:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-01-12 11:17:44,642 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 39 [2019-01-12 11:17:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:17:44,642 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-01-12 11:17:44,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 11:17:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-01-12 11:17:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 11:17:44,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 11:17:44,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 11:17:44,645 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 11:17:44,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 11:17:44,645 INFO L82 PathProgramCache]: Analyzing trace with hash 664905863, now seen corresponding path program 1 times [2019-01-12 11:17:44,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 11:17:44,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 11:17:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:44,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 11:17:44,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 11:17:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 11:17:44,758 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:17:44,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 11:17:44,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 11:17:44,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 11:17:44,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 11:17:44,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 11:17:44,759 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 6 states. [2019-01-12 11:17:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 11:17:45,022 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-12 11:17:45,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 11:17:45,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-01-12 11:17:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 11:17:45,030 INFO L225 Difference]: With dead ends: 58 [2019-01-12 11:17:45,030 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 11:17:45,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-12 11:17:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 11:17:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 11:17:45,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 11:17:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 11:17:45,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-12 11:17:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 11:17:45,032 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 11:17:45,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 11:17:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 11:17:45,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 11:17:45,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 11:17:45,252 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2019-01-12 11:17:45,354 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-01-12 11:17:45,643 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 18 [2019-01-12 11:17:45,843 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-01-12 11:17:46,081 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-12 11:17:46,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,357 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-01-12 11:17:46,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 11:17:46,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,357 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-01-12 11:17:46,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,357 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,358 INFO L444 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,358 INFO L448 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,358 INFO L444 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,358 INFO L448 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,358 INFO L444 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,359 INFO L448 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,359 INFO L448 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,359 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,359 INFO L444 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0) (<= 0 ULTIMATE.start_main_~scheme~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,359 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-01-12 11:17:46,359 INFO L448 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,359 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2019-01-12 11:17:46,359 INFO L444 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0) (<= 0 ULTIMATE.start_main_~scheme~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,360 INFO L448 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,360 INFO L444 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,360 INFO L448 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,360 INFO L444 ceAbstractionStarter]: At program point L4-23(line 41) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,360 INFO L448 ceAbstractionStarter]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,360 INFO L444 ceAbstractionStarter]: At program point L4-26(lines 3 8) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0) (<= 0 ULTIMATE.start_main_~scheme~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,360 INFO L448 ceAbstractionStarter]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,361 INFO L444 ceAbstractionStarter]: At program point L4-29(line 44) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0) (<= 0 ULTIMATE.start_main_~scheme~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,361 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,361 INFO L448 ceAbstractionStarter]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,361 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,361 INFO L448 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,361 INFO L444 ceAbstractionStarter]: At program point L4-32(lines 3 8) the Hoare annotation is: (and (= ULTIMATE.start_main_~c~0 0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0) (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,361 INFO L448 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,361 INFO L448 ceAbstractionStarter]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,361 INFO L448 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,362 INFO L448 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,362 INFO L448 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,362 INFO L448 ceAbstractionStarter]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,362 INFO L448 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,362 INFO L448 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,362 INFO L444 ceAbstractionStarter]: At program point L4-38(lines 3 8) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)) (.cse1 (<= 1 ULTIMATE.start_main_~cp~0)) (.cse2 (<= 0 ULTIMATE.start_main_~scheme~0)) (.cse3 (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0)) (.cse4 (= ULTIMATE.start___VERIFIER_assert_~cond 1))) (or (and (= ULTIMATE.start_main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_main_~c~0)))) [2019-01-12 11:17:46,362 INFO L448 ceAbstractionStarter]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,362 INFO L448 ceAbstractionStarter]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,362 INFO L448 ceAbstractionStarter]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,363 INFO L448 ceAbstractionStarter]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,363 INFO L444 ceAbstractionStarter]: At program point L4-41(lines 3 8) the Hoare annotation is: (let ((.cse0 (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)) (.cse1 (<= 1 ULTIMATE.start_main_~cp~0)) (.cse2 (<= 0 ULTIMATE.start_main_~scheme~0)) (.cse3 (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0)) (.cse4 (= ULTIMATE.start___VERIFIER_assert_~cond 1))) (or (and (= ULTIMATE.start_main_~c~0 0) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_main_~c~0)))) [2019-01-12 11:17:46,363 INFO L448 ceAbstractionStarter]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,363 INFO L448 ceAbstractionStarter]: For program point L4-42(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,363 INFO L448 ceAbstractionStarter]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,363 INFO L448 ceAbstractionStarter]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,363 INFO L444 ceAbstractionStarter]: At program point L4-44(lines 3 8) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0) (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 1 ULTIMATE.start_main_~c~0)) [2019-01-12 11:17:46,364 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2019-01-12 11:17:46,364 INFO L448 ceAbstractionStarter]: For program point L5-14(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,364 INFO L448 ceAbstractionStarter]: For program point L4-45(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,364 INFO L448 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2019-01-12 11:17:46,364 INFO L448 ceAbstractionStarter]: For program point L5-15(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,364 INFO L444 ceAbstractionStarter]: At program point L55-1(lines 55 61) the Hoare annotation is: (let ((.cse0 (<= 1 ULTIMATE.start_main_~cp~0)) (.cse1 (<= 0 ULTIMATE.start_main_~scheme~0)) (.cse2 (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0)) (.cse3 (= ULTIMATE.start___VERIFIER_assert_~cond 1))) (or (and (= ULTIMATE.start_main_~c~0 0) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ULTIMATE.start_main_~c~0)))) [2019-01-12 11:17:46,364 INFO L444 ceAbstractionStarter]: At program point L4-47(lines 3 8) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0) (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 1 ULTIMATE.start_main_~c~0)) [2019-01-12 11:17:46,364 INFO L448 ceAbstractionStarter]: For program point L5-16(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,365 INFO L448 ceAbstractionStarter]: For program point L4-48(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,365 INFO L448 ceAbstractionStarter]: For program point L5-17(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,365 INFO L444 ceAbstractionStarter]: At program point L4-50(lines 3 8) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0) (<= (+ ULTIMATE.start_main_~cp~0 2) ULTIMATE.start_main_~urilen~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1) (<= 1 ULTIMATE.start_main_~c~0)) [2019-01-12 11:17:46,365 INFO L448 ceAbstractionStarter]: For program point L4-51(lines 4 6) no Hoare annotation was computed. [2019-01-12 11:17:46,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,365 INFO L448 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2019-01-12 11:17:46,365 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 11:17:46,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 11:17:46,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,366 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2019-01-12 11:17:46,366 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,367 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2019-01-12 11:17:46,367 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,367 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,367 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,367 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,367 INFO L444 ceAbstractionStarter]: At program point L33-1(lines 3 38) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) [2019-01-12 11:17:46,367 INFO L448 ceAbstractionStarter]: For program point L33-2(lines 33 38) no Hoare annotation was computed. [2019-01-12 11:17:46,368 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,368 INFO L451 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2019-01-12 11:17:46,368 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 11:17:46,368 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-01-12 11:17:46,368 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-01-12 11:17:46,368 INFO L444 ceAbstractionStarter]: At program point L51-1(lines 3 63) the Hoare annotation is: (let ((.cse0 (and (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0) (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~scheme~0))) (.cse1 (= ULTIMATE.start___VERIFIER_assert_~cond 1))) (or (and (= ULTIMATE.start_main_~c~0 0) .cse0 .cse1) (and .cse0 .cse1 (<= 1 ULTIMATE.start_main_~c~0)))) [2019-01-12 11:17:46,368 INFO L451 ceAbstractionStarter]: At program point L68(lines 10 69) the Hoare annotation is: true [2019-01-12 11:17:46,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 11:17:46 BoogieIcfgContainer [2019-01-12 11:17:46,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 11:17:46,409 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 11:17:46,409 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 11:17:46,410 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 11:17:46,410 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 11:17:40" (3/4) ... [2019-01-12 11:17:46,415 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 11:17:46,435 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-01-12 11:17:46,435 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 11:17:46,532 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 11:17:46,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 11:17:46,534 INFO L168 Benchmark]: Toolchain (without parser) took 7091.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:17:46,538 INFO L168 Benchmark]: CDTParser took 0.23 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:17:46,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.17 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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:17:46,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.59 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 11:17:46,538 INFO L168 Benchmark]: Boogie Preprocessor took 56.91 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 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:17:46,539 INFO L168 Benchmark]: RCFGBuilder took 1001.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 936.6 MB in the beginning and 1.0 GB in the end (delta: -110.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-01-12 11:17:46,539 INFO L168 Benchmark]: TraceAbstraction took 5506.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -92.4 MB). Peak memory consumption was 325.0 MB. Max. memory is 11.5 GB. [2019-01-12 11:17:46,543 INFO L168 Benchmark]: Witness Printer took 122.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-01-12 11:17:46,547 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.23 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 317.17 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 81.59 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.91 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1001.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.8 MB). Free memory was 936.6 MB in the beginning and 1.0 GB in the end (delta: -110.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5506.19 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 89.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -92.4 MB). Peak memory consumption was 325.0 MB. Max. memory is 11.5 GB. * Witness Printer took 122.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - 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 - 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 - 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 - 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 - 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 - 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 18 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 0 <= scheme) && cond == 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((c == 0 && c + 2 <= tokenlen) && 1 <= cp) && 0 <= scheme) && cp + 2 <= urilen) && cond == 1) || (((((c + 2 <= tokenlen && 1 <= cp) && 0 <= scheme) && cp + 2 <= urilen) && cond == 1) && 1 <= c) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 0 <= scheme) && cond == 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((1 <= cp && cp + 2 <= urilen) && 0 <= scheme) && cond == 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((1 <= cp && 0 <= scheme) && cp + 2 <= urilen) && cond == 1) && 1 <= c - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((c == 0 && (cp + 1 <= urilen && 1 <= cp) && 0 <= scheme) && cond == 1) || ((((cp + 1 <= urilen && 1 <= cp) && 0 <= scheme) && cond == 1) && 1 <= c) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((1 <= cp && cp + 2 <= urilen) && 0 <= scheme) && cond == 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((c == 0 && c + 2 <= tokenlen) && 1 <= cp) && 0 <= scheme) && cp + 2 <= urilen) && cond == 1) || (((((c + 2 <= tokenlen && 1 <= cp) && 0 <= scheme) && cp + 2 <= urilen) && cond == 1) && 1 <= c) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 0 <= scheme) && cond == 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((1 <= cp && cp + 2 <= urilen) && 0 <= scheme) && cond == 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((1 <= cp && 0 <= scheme) && cp + 2 <= urilen) && cond == 1) && 1 <= c - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 0 <= scheme) && cond == 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((1 <= cp && cp + 2 <= urilen) && 0 <= scheme) && cond == 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((c == 0 && 1 <= cp) && 0 <= scheme) && cp + 2 <= urilen) && cond == 1) || ((((1 <= cp && 0 <= scheme) && cp + 2 <= urilen) && cond == 1) && 1 <= c) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 0 <= scheme) && cond == 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((cp + 1 <= urilen && 1 <= cp) && 0 <= scheme) && cond == 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((1 <= cp && 0 <= scheme) && cp + 2 <= urilen) && cond == 1) && 1 <= c - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((c == 0 && 1 <= cp) && 0 <= scheme) && cp + 2 <= urilen) && cond == 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 18 error locations. SAFE Result, 5.4s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 304 SDtfs, 282 SDslu, 323 SDs, 0 SdLazy, 506 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 46 NumberOfFragments, 398 HoareAnnotationTreeSize, 20 FomulaSimplifications, 238 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 464 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 12957 SizeOfPredicates, 7 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...