./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 91b1670e 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-91b1670 [2018-11-28 18:20:40,833 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:20:40,835 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:20:40,847 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:20:40,847 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:20:40,848 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:20:40,850 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:20:40,852 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:20:40,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:20:40,855 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:20:40,856 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:20:40,856 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:20:40,857 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:20:40,858 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:20:40,859 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:20:40,860 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:20:40,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:20:40,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:20:40,865 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:20:40,867 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:20:40,868 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:20:40,869 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:20:40,872 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:20:40,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:20:40,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:20:40,874 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:20:40,875 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:20:40,876 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:20:40,877 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:20:40,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:20:40,879 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:20:40,880 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:20:40,880 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:20:40,880 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:20:40,881 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:20:40,882 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:20:40,883 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:20:40,898 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:20:40,898 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:20:40,899 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:20:40,899 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:20:40,900 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:20:40,900 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:20:40,900 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:20:40,901 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:20:40,901 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:20:40,901 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:20:40,901 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:20:40,901 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:20:40,902 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:20:40,902 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:20:40,902 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:20:40,902 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:20:40,902 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:20:40,903 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:20:40,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:20:40,904 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:20:40,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:20:40,905 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:20:40,905 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:20:40,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:20:40,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:20:40,906 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:20:40,907 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:20:40,907 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:20:40,907 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:20:40,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:20:40,907 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 [2018-11-28 18:20:40,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:20:40,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:20:40,992 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:20:40,995 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:20:40,995 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:20:40,996 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-28 18:20:41,062 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4a357a9/e8297e3348d145b9842735c728b25098/FLAG0bd2b6f95 [2018-11-28 18:20:41,535 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:20:41,536 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-28 18:20:41,542 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4a357a9/e8297e3348d145b9842735c728b25098/FLAG0bd2b6f95 [2018-11-28 18:20:41,898 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4a357a9/e8297e3348d145b9842735c728b25098 [2018-11-28 18:20:41,901 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:20:41,902 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:20:41,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:20:41,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:20:41,908 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:20:41,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:41" (1/1) ... [2018-11-28 18:20:41,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa6d630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:41, skipping insertion in model container [2018-11-28 18:20:41,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:41" (1/1) ... [2018-11-28 18:20:41,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:20:41,946 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:20:42,137 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:20:42,145 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:20:42,176 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:20:42,200 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:20:42,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42 WrapperNode [2018-11-28 18:20:42,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:20:42,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:20:42,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:20:42,202 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:20:42,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (1/1) ... [2018-11-28 18:20:42,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (1/1) ... [2018-11-28 18:20:42,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:20:42,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:20:42,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:20:42,227 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:20:42,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (1/1) ... [2018-11-28 18:20:42,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (1/1) ... [2018-11-28 18:20:42,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (1/1) ... [2018-11-28 18:20:42,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (1/1) ... [2018-11-28 18:20:42,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (1/1) ... [2018-11-28 18:20:42,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (1/1) ... [2018-11-28 18:20:42,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (1/1) ... [2018-11-28 18:20:42,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:20:42,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:20:42,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:20:42,260 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:20:42,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (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 [2018-11-28 18:20:42,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:20:42,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:20:42,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:20:42,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:20:42,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:20:42,396 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:20:42,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 18:20:42,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 18:20:42,885 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:20:42,885 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 18:20:42,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:42 BoogieIcfgContainer [2018-11-28 18:20:42,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:20:42,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:20:42,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:20:42,890 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:20:42,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:20:41" (1/3) ... [2018-11-28 18:20:42,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6edd00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:42, skipping insertion in model container [2018-11-28 18:20:42,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:42" (2/3) ... [2018-11-28 18:20:42,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6edd00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:42, skipping insertion in model container [2018-11-28 18:20:42,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:42" (3/3) ... [2018-11-28 18:20:42,894 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-28 18:20:42,905 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:20:42,918 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 18:20:42,934 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 18:20:42,972 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:20:42,972 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:20:42,973 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:20:42,973 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:20:42,973 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:20:42,973 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:20:42,973 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:20:42,974 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:20:42,974 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:20:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-11-28 18:20:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 18:20:43,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:43,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:43,009 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:43,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:43,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1277279000, now seen corresponding path program 1 times [2018-11-28 18:20:43,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:43,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:43,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:43,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:43,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:43,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:43,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:20:43,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:20:43,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:20:43,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:20:43,260 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2018-11-28 18:20:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:43,803 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2018-11-28 18:20:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:20:43,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-28 18:20:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:43,817 INFO L225 Difference]: With dead ends: 111 [2018-11-28 18:20:43,817 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 18:20:43,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:20:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 18:20:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-11-28 18:20:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 18:20:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2018-11-28 18:20:43,877 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2018-11-28 18:20:43,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:43,877 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2018-11-28 18:20:43,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:20:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2018-11-28 18:20:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 18:20:43,879 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:43,880 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:43,880 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:43,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1256946511, now seen corresponding path program 1 times [2018-11-28 18:20:43,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:43,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:43,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:43,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:43,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:44,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:44,030 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 [2018-11-28 18:20:44,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:44,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:44,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:20:44,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:44,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-28 18:20:44,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:20:44,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:20:44,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:20:44,316 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 9 states. [2018-11-28 18:20:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:45,156 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2018-11-28 18:20:45,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:20:45,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-28 18:20:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:45,161 INFO L225 Difference]: With dead ends: 62 [2018-11-28 18:20:45,161 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 18:20:45,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:20:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 18:20:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-28 18:20:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 18:20:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2018-11-28 18:20:45,179 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2018-11-28 18:20:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:45,179 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2018-11-28 18:20:45,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:20:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2018-11-28 18:20:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 18:20:45,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:45,182 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2018-11-28 18:20:45,182 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:45,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2038837229, now seen corresponding path program 1 times [2018-11-28 18:20:45,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:45,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:45,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:45,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:45,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-28 18:20:45,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:20:45,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 18:20:45,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 18:20:45,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 18:20:45,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 18:20:45,252 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand 3 states. [2018-11-28 18:20:45,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:45,323 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2018-11-28 18:20:45,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 18:20:45,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 18:20:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:45,326 INFO L225 Difference]: With dead ends: 89 [2018-11-28 18:20:45,326 INFO L226 Difference]: Without dead ends: 60 [2018-11-28 18:20:45,327 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 [2018-11-28 18:20:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-28 18:20:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-28 18:20:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 18:20:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2018-11-28 18:20:45,341 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2018-11-28 18:20:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:45,342 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2018-11-28 18:20:45,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 18:20:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2018-11-28 18:20:45,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 18:20:45,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:45,344 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 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] [2018-11-28 18:20:45,344 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:45,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:45,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1689114790, now seen corresponding path program 1 times [2018-11-28 18:20:45,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:45,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:45,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:45,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:45,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-28 18:20:45,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:45,524 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:45,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:45,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-28 18:20:45,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:45,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-28 18:20:45,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:20:45,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:20:45,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:20:45,651 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 9 states. [2018-11-28 18:20:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:46,077 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2018-11-28 18:20:46,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:20:46,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-28 18:20:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:46,081 INFO L225 Difference]: With dead ends: 67 [2018-11-28 18:20:46,081 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 18:20:46,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:20:46,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 18:20:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-28 18:20:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 18:20:46,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2018-11-28 18:20:46,095 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2018-11-28 18:20:46,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:46,096 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-11-28 18:20:46,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:20:46,096 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2018-11-28 18:20:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-28 18:20:46,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:46,100 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:46,100 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:46,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:46,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1728052911, now seen corresponding path program 1 times [2018-11-28 18:20:46,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:46,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:46,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:46,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 23 proven. 34 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-11-28 18:20:46,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:46,268 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:46,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:46,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-28 18:20:46,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:46,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-28 18:20:46,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:20:46,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:20:46,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:20:46,399 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 9 states. [2018-11-28 18:20:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:47,164 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2018-11-28 18:20:47,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:20:47,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-11-28 18:20:47,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:47,168 INFO L225 Difference]: With dead ends: 73 [2018-11-28 18:20:47,168 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 18:20:47,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:20:47,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 18:20:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-11-28 18:20:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 18:20:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-11-28 18:20:47,182 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 86 [2018-11-28 18:20:47,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:47,183 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-11-28 18:20:47,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:20:47,183 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-28 18:20:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-28 18:20:47,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:20:47,188 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:20:47,188 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:20:47,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:20:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash -733340726, now seen corresponding path program 1 times [2018-11-28 18:20:47,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:20:47,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:20:47,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:47,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:20:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 25 proven. 37 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-28 18:20:47,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:20:47,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:20:47,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:20:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:20:47,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:20:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-28 18:20:47,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 18:20:47,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-11-28 18:20:47,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 18:20:47,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 18:20:47,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:20:47,574 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 10 states. [2018-11-28 18:20:47,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:20:47,946 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2018-11-28 18:20:47,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 18:20:47,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-11-28 18:20:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:20:47,948 INFO L225 Difference]: With dead ends: 74 [2018-11-28 18:20:47,948 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:20:47,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:20:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:20:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:20:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:20:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:20:47,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2018-11-28 18:20:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:20:47,951 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:20:47,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 18:20:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:20:47,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:20:47,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:20:48,537 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 18:20:48,625 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 18:20:48,625 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:20:48,625 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:20:48,625 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:20:48,626 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:20:48,626 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:20:48,626 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 69) no Hoare annotation was computed. [2018-11-28 18:20:48,626 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-28 18:20:48,626 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-28 18:20:48,626 INFO L444 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-28 18:20:48,626 INFO L444 ceAbstractionStarter]: At program point L28-1(line 28) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-28 18:20:48,627 INFO L444 ceAbstractionStarter]: At program point L53(line 53) the Hoare annotation is: (let ((.cse5 (+ main_~cp~0 1))) (let ((.cse0 (not (= main_~urilen~0 .cse5))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= .cse5 main_~urilen~0)) (.cse3 (<= 0 main_~scheme~0)) (.cse4 (<= (+ main_~c~0 2) main_~tokenlen~0))) (or (and .cse0 .cse1 (= main_~c~0 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~c~0) .cse4)))) [2018-11-28 18:20:48,627 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-28 18:20:48,627 INFO L444 ceAbstractionStarter]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse5 (+ main_~cp~0 1))) (let ((.cse0 (not (= main_~urilen~0 .cse5))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (<= .cse5 main_~urilen~0)) (.cse3 (<= 0 main_~scheme~0)) (.cse4 (<= (+ main_~c~0 2) main_~tokenlen~0))) (or (and .cse0 .cse1 (= main_~c~0 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (<= 1 main_~c~0) .cse4)))) [2018-11-28 18:20:48,627 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-28 18:20:48,627 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-28 18:20:48,627 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-28 18:20:48,627 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2018-11-28 18:20:48,628 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 69) no Hoare annotation was computed. [2018-11-28 18:20:48,628 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2018-11-28 18:20:48,628 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 69) the Hoare annotation is: true [2018-11-28 18:20:48,628 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2018-11-28 18:20:48,628 INFO L448 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2018-11-28 18:20:48,628 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 55 61) no Hoare annotation was computed. [2018-11-28 18:20:48,628 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2018-11-28 18:20:48,629 INFO L444 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-28 18:20:48,629 INFO L444 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-28 18:20:48,629 INFO L444 ceAbstractionStarter]: At program point L31-1(line 31) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-28 18:20:48,629 INFO L448 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2018-11-28 18:20:48,629 INFO L448 ceAbstractionStarter]: For program point L40(lines 30 66) no Hoare annotation was computed. [2018-11-28 18:20:48,629 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= main_~urilen~0 .cse0)) (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0))) [2018-11-28 18:20:48,629 INFO L444 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= main_~urilen~0 .cse0)) (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0))) [2018-11-28 18:20:48,630 INFO L444 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (not (= main_~urilen~0 .cse0)) (<= 1 main_~cp~0) (= main_~c~0 0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0))) [2018-11-28 18:20:48,630 INFO L444 ceAbstractionStarter]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (not (= main_~urilen~0 .cse0)) (<= 1 main_~cp~0) (= main_~c~0 0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0))) [2018-11-28 18:20:48,630 INFO L444 ceAbstractionStarter]: At program point L33-1(lines 32 38) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-28 18:20:48,630 INFO L444 ceAbstractionStarter]: At program point L33-2(lines 33 38) the Hoare annotation is: (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)) [2018-11-28 18:20:48,630 INFO L444 ceAbstractionStarter]: At program point L58(line 58) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= main_~urilen~0 .cse0)) (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0))) [2018-11-28 18:20:48,630 INFO L444 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (not (= main_~urilen~0 .cse0)) (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0))) [2018-11-28 18:20:48,631 INFO L444 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (not (= main_~urilen~0 .cse0)) (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0))) [2018-11-28 18:20:48,631 INFO L451 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2018-11-28 18:20:48,631 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-28 18:20:48,631 INFO L444 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (<= (+ main_~c~0 1) main_~tokenlen~0) (not (= main_~urilen~0 .cse0)) (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0) (<= 1 main_~c~0))) [2018-11-28 18:20:48,631 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-28 18:20:48,631 INFO L444 ceAbstractionStarter]: At program point L51-1(lines 50 63) the Hoare annotation is: (let ((.cse0 (and (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 0 main_~scheme~0)))) (or (and .cse0 (<= 1 main_~c~0)) (and .cse0 (= main_~c~0 0)))) [2018-11-28 18:20:48,631 INFO L448 ceAbstractionStarter]: For program point L43(lines 30 66) no Hoare annotation was computed. [2018-11-28 18:20:48,632 INFO L444 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (not (= main_~urilen~0 .cse0)) (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0))) [2018-11-28 18:20:48,632 INFO L444 ceAbstractionStarter]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 (+ main_~cp~0 1))) (and (not (= main_~urilen~0 .cse0)) (<= 1 main_~cp~0) (<= .cse0 main_~urilen~0) (<= 0 main_~scheme~0))) [2018-11-28 18:20:48,632 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-28 18:20:48,632 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-28 18:20:48,632 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-28 18:20:48,632 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-28 18:20:48,632 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-28 18:20:48,632 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-28 18:20:48,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:20:48 BoogieIcfgContainer [2018-11-28 18:20:48,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:20:48,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:20:48,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:20:48,649 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:20:48,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:42" (3/4) ... [2018-11-28 18:20:48,653 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:20:48,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:20:48,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:20:48,659 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 18:20:48,665 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-28 18:20:48,665 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-28 18:20:48,666 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 18:20:48,759 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:20:48,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:20:48,760 INFO L168 Benchmark]: Toolchain (without parser) took 6858.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:20:48,761 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:20:48,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.15 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 18:20:48,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.50 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:20:48,765 INFO L168 Benchmark]: Boogie Preprocessor took 32.10 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:20:48,766 INFO L168 Benchmark]: RCFGBuilder took 626.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:20:48,766 INFO L168 Benchmark]: TraceAbstraction took 5761.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.5 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:20:48,766 INFO L168 Benchmark]: Witness Printer took 110.81 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: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2018-11-28 18:20:48,769 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 297.15 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 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 25.50 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.10 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 626.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5761.53 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -22.5 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * Witness Printer took 110.81 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: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((1 <= cp && cp + 1 <= urilen) && 0 <= scheme) && 1 <= c) || (((1 <= cp && cp + 1 <= urilen) && 0 <= scheme) && c == 0) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (1 <= cp && cp + 1 <= urilen) && 0 <= scheme - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 1 error locations. SAFE Result, 5.6s OverallTime, 6 OverallIterations, 14 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 328 SDtfs, 113 SDslu, 1039 SDs, 0 SdLazy, 834 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 256 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 76 PreInvPairs, 102 NumberOfFragments, 447 HoareAnnotationTreeSize, 76 FomulaSimplifications, 154 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 49 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 554 ConstructedInterpolants, 0 QuantifiedInterpolants, 58774 SizeOfPredicates, 10 NumberOfNonLiveVariables, 522 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 1377/1472 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...