java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:40:01,705 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:40:01,707 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:40:01,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:40:01,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:40:01,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:40:01,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:40:01,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:40:01,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:40:01,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:40:01,726 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:40:01,727 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:40:01,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:40:01,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:40:01,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:40:01,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:40:01,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:40:01,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:40:01,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:40:01,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:40:01,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:40:01,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:40:01,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:40:01,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:40:01,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:40:01,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:40:01,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:40:01,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:40:01,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:40:01,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:40:01,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:40:01,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:40:01,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:40:01,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:40:01,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:40:01,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:40:01,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:40:01,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:40:01,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:40:01,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:40:01,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:40:01,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:40:01,805 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:40:01,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:40:01,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:40:01,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:40:01,808 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:40:01,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:40:01,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:40:01,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:40:01,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:40:01,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:40:01,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:40:01,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:40:01,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:40:01,811 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:40:01,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:40:01,811 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:40:01,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:40:01,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:40:01,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:40:01,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:40:01,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:40:01,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:40:01,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:40:01,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:40:01,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:40:01,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:40:01,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:40:01,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:40:01,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:40:02,098 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:40:02,111 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:40:02,115 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:40:02,116 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:40:02,117 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:40:02,118 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2019-10-07 13:40:02,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e183f0f57/357c324c3982410cb190d415a4feae9e/FLAG5c010aad6 [2019-10-07 13:40:02,677 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:40:02,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2019-10-07 13:40:02,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e183f0f57/357c324c3982410cb190d415a4feae9e/FLAG5c010aad6 [2019-10-07 13:40:03,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e183f0f57/357c324c3982410cb190d415a4feae9e [2019-10-07 13:40:03,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:40:03,068 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:40:03,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:03,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:40:03,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:40:03,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:03" (1/1) ... [2019-10-07 13:40:03,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5423e3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03, skipping insertion in model container [2019-10-07 13:40:03,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:40:03" (1/1) ... [2019-10-07 13:40:03,085 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:40:03,106 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:40:03,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:03,334 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:40:03,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:40:03,464 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:40:03,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03 WrapperNode [2019-10-07 13:40:03,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:40:03,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:40:03,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:40:03,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:40:03,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03" (1/1) ... [2019-10-07 13:40:03,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03" (1/1) ... [2019-10-07 13:40:03,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03" (1/1) ... [2019-10-07 13:40:03,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03" (1/1) ... [2019-10-07 13:40:03,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03" (1/1) ... [2019-10-07 13:40:03,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03" (1/1) ... [2019-10-07 13:40:03,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03" (1/1) ... [2019-10-07 13:40:03,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:40:03,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:40:03,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:40:03,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:40:03,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03" (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-10-07 13:40:03,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:40:03,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:40:03,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:40:03,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:40:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:40:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:40:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:40:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:40:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:40:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:40:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:40:03,939 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:40:03,939 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:40:03,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:03 BoogieIcfgContainer [2019-10-07 13:40:03,941 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:40:03,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:40:03,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:40:03,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:40:03,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:40:03" (1/3) ... [2019-10-07 13:40:03,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f66859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:03, skipping insertion in model container [2019-10-07 13:40:03,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:40:03" (2/3) ... [2019-10-07 13:40:03,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f66859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:40:03, skipping insertion in model container [2019-10-07 13:40:03,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:40:03" (3/3) ... [2019-10-07 13:40:03,949 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2019-10-07 13:40:03,959 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:40:03,967 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:40:03,979 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:40:04,004 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:40:04,004 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:40:04,004 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:40:04,005 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:40:04,005 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:40:04,005 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:40:04,005 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:40:04,005 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:40:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-10-07 13:40:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:40:04,030 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:04,031 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:04,032 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:04,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:04,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1277279000, now seen corresponding path program 1 times [2019-10-07 13:40:04,044 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:04,045 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:04,045 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:04,045 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:04,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:04,237 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:04,238 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:04,238 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 13:40:04,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 13:40:04,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 13:40:04,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:40:04,256 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2019-10-07 13:40:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:04,510 INFO L93 Difference]: Finished difference Result 111 states and 201 transitions. [2019-10-07 13:40:04,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 13:40:04,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-07 13:40:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:04,524 INFO L225 Difference]: With dead ends: 111 [2019-10-07 13:40:04,524 INFO L226 Difference]: Without dead ends: 63 [2019-10-07 13:40:04,529 INFO L606 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 [2019-10-07 13:40:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-07 13:40:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2019-10-07 13:40:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-07 13:40:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2019-10-07 13:40:04,621 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2019-10-07 13:40:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:04,622 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2019-10-07 13:40:04,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 13:40:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2019-10-07 13:40:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-07 13:40:04,624 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:04,625 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:40:04,625 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:04,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:04,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1256946511, now seen corresponding path program 1 times [2019-10-07 13:40:04,626 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:04,626 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:04,627 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:04,627 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:40:04,752 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:04,752 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:04,753 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:04,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:04,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:04,755 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 6 states. [2019-10-07 13:40:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:05,003 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2019-10-07 13:40:05,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:40:05,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-10-07 13:40:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:05,007 INFO L225 Difference]: With dead ends: 62 [2019-10-07 13:40:05,007 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 13:40:05,009 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:40:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 13:40:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-07 13:40:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-07 13:40:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2019-10-07 13:40:05,025 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2019-10-07 13:40:05,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:05,025 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2019-10-07 13:40:05,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2019-10-07 13:40:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 13:40:05,028 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:05,028 INFO L385 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] [2019-10-07 13:40:05,028 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:05,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2142639325, now seen corresponding path program 1 times [2019-10-07 13:40:05,029 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:05,029 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:05,030 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:05,030 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:05,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-07 13:40:05,126 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:05,127 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:05,127 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:40:05,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:40:05,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:40:05,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:40:05,129 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand 3 states. [2019-10-07 13:40:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:05,178 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2019-10-07 13:40:05,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:40:05,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-07 13:40:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:05,180 INFO L225 Difference]: With dead ends: 89 [2019-10-07 13:40:05,180 INFO L226 Difference]: Without dead ends: 60 [2019-10-07 13:40:05,181 INFO L606 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-10-07 13:40:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-07 13:40:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-07 13:40:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-07 13:40:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2019-10-07 13:40:05,194 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2019-10-07 13:40:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:05,195 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2019-10-07 13:40:05,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:40:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2019-10-07 13:40:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-07 13:40:05,197 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:05,197 INFO L385 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] [2019-10-07 13:40:05,197 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1689114790, now seen corresponding path program 1 times [2019-10-07 13:40:05,198 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:05,198 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:05,198 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:05,199 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:05,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-07 13:40:05,300 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:05,300 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:05,300 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:05,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:05,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:05,302 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2019-10-07 13:40:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:05,459 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-10-07 13:40:05,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:40:05,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-07 13:40:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:05,461 INFO L225 Difference]: With dead ends: 67 [2019-10-07 13:40:05,461 INFO L226 Difference]: Without dead ends: 65 [2019-10-07 13:40:05,462 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-07 13:40:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-10-07 13:40:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-07 13:40:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-10-07 13:40:05,474 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2019-10-07 13:40:05,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:05,475 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-10-07 13:40:05,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2019-10-07 13:40:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-07 13:40:05,478 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:05,479 INFO L385 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] [2019-10-07 13:40:05,479 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:05,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:05,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1728052911, now seen corresponding path program 1 times [2019-10-07 13:40:05,480 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:05,480 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:05,480 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:05,480 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:05,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-10-07 13:40:05,617 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:05,617 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:05,618 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 13:40:05,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 13:40:05,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 13:40:05,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:05,622 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 7 states. [2019-10-07 13:40:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:05,737 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2019-10-07 13:40:05,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:40:05,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-10-07 13:40:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:05,743 INFO L225 Difference]: With dead ends: 83 [2019-10-07 13:40:05,743 INFO L226 Difference]: Without dead ends: 81 [2019-10-07 13:40:05,744 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-07 13:40:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-07 13:40:05,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2019-10-07 13:40:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-07 13:40:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2019-10-07 13:40:05,774 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 86 [2019-10-07 13:40:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:05,775 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2019-10-07 13:40:05,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 13:40:05,775 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2019-10-07 13:40:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-07 13:40:05,784 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:05,784 INFO L385 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] [2019-10-07 13:40:05,784 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:05,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:05,785 INFO L82 PathProgramCache]: Analyzing trace with hash -733340726, now seen corresponding path program 1 times [2019-10-07 13:40:05,785 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:05,785 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:05,785 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:05,786 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-10-07 13:40:05,946 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:05,947 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:40:05,947 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:40:05,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:40:05,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:40:05,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:40:05,948 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand 6 states. [2019-10-07 13:40:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:06,069 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2019-10-07 13:40:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:40:06,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-10-07 13:40:06,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:06,071 INFO L225 Difference]: With dead ends: 81 [2019-10-07 13:40:06,072 INFO L226 Difference]: Without dead ends: 79 [2019-10-07 13:40:06,074 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-07 13:40:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-10-07 13:40:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-10-07 13:40:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-07 13:40:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-10-07 13:40:06,089 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 91 [2019-10-07 13:40:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:06,089 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-10-07 13:40:06,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:40:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-10-07 13:40:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-07 13:40:06,092 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:40:06,092 INFO L385 BasicCegarLoop]: trace histogram [19, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-07 13:40:06,092 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:40:06,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:40:06,093 INFO L82 PathProgramCache]: Analyzing trace with hash 259979376, now seen corresponding path program 1 times [2019-10-07 13:40:06,093 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:40:06,093 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:06,094 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:06,094 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:40:06,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:40:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-10-07 13:40:06,219 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:40:06,225 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:40:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:40:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:40:06,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-07 13:40:06,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:40:06,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 13:40:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-07 13:40:06,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:40:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-07 13:40:06,495 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 13:40:06,496 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2019-10-07 13:40:06,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 13:40:06,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 13:40:06,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:40:06,497 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 8 states. [2019-10-07 13:40:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:40:06,585 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2019-10-07 13:40:06,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 13:40:06,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 120 [2019-10-07 13:40:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:40:06,587 INFO L225 Difference]: With dead ends: 82 [2019-10-07 13:40:06,587 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:40:06,588 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 237 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:40:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:40:06,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:40:06,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:40:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:40:06,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2019-10-07 13:40:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:40:06,590 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:40:06,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 13:40:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:40:06,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:40:06,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:40:06,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:40:07,280 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:40:07,281 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:40:07,281 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:40:07,281 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:40:07,281 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:40:07,281 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:40:07,282 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 69) no Hoare annotation was computed. [2019-10-07 13:40:07,282 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-07 13:40:07,282 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-10-07 13:40:07,282 INFO L439 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0)) [2019-10-07 13:40:07,282 INFO L439 ceAbstractionStarter]: At program point L28-1(line 28) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0)) [2019-10-07 13:40:07,283 INFO L439 ceAbstractionStarter]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse3 (< main_~cp~0 main_~urilen~0)) (.cse4 (<= (+ main_~c~0 2) main_~tokenlen~0))) (or (and .cse0 .cse1 (= main_~c~0 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (<= 1 main_~c~0) .cse3 .cse4))) [2019-10-07 13:40:07,283 INFO L443 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-10-07 13:40:07,283 INFO L439 ceAbstractionStarter]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= 1 main_~cp~0)) (.cse2 (not (= (+ main_~cp~0 1) main_~urilen~0))) (.cse3 (< main_~cp~0 main_~urilen~0)) (.cse4 (<= (+ main_~c~0 2) main_~tokenlen~0))) (or (and .cse0 .cse1 (= main_~c~0 0) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (<= 1 main_~c~0) .cse3 .cse4))) [2019-10-07 13:40:07,283 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-10-07 13:40:07,283 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-10-07 13:40:07,283 INFO L443 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-10-07 13:40:07,284 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2019-10-07 13:40:07,284 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 69) no Hoare annotation was computed. [2019-10-07 13:40:07,284 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2019-10-07 13:40:07,284 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 69) the Hoare annotation is: true [2019-10-07 13:40:07,284 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2019-10-07 13:40:07,284 INFO L443 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2019-10-07 13:40:07,285 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 55 61) no Hoare annotation was computed. [2019-10-07 13:40:07,285 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2019-10-07 13:40:07,285 INFO L439 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2019-10-07 13:40:07,285 INFO L439 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0)) [2019-10-07 13:40:07,285 INFO L439 ceAbstractionStarter]: At program point L31-1(line 31) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0)) [2019-10-07 13:40:07,285 INFO L443 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2019-10-07 13:40:07,286 INFO L443 ceAbstractionStarter]: For program point L40(lines 30 66) no Hoare annotation was computed. [2019-10-07 13:40:07,286 INFO L439 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2019-10-07 13:40:07,286 INFO L439 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2019-10-07 13:40:07,286 INFO L439 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (= main_~c~0 0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2019-10-07 13:40:07,286 INFO L439 ceAbstractionStarter]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (= main_~c~0 0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2019-10-07 13:40:07,287 INFO L439 ceAbstractionStarter]: At program point L33-1(lines 32 38) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0)) [2019-10-07 13:40:07,287 INFO L439 ceAbstractionStarter]: At program point L33-2(lines 33 38) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2019-10-07 13:40:07,287 INFO L439 ceAbstractionStarter]: At program point L58(line 58) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2019-10-07 13:40:07,287 INFO L439 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2019-10-07 13:40:07,287 INFO L439 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2019-10-07 13:40:07,287 INFO L446 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2019-10-07 13:40:07,288 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-07 13:40:07,288 INFO L439 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2019-10-07 13:40:07,288 INFO L443 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-10-07 13:40:07,288 INFO L439 ceAbstractionStarter]: At program point L51-1(lines 50 63) the Hoare annotation is: (let ((.cse0 (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (<= (+ main_~cp~0 1) main_~urilen~0)))) (or (and .cse0 (<= 1 main_~c~0) (< main_~c~0 main_~tokenlen~0)) (and (= main_~c~0 0) .cse0))) [2019-10-07 13:40:07,288 INFO L443 ceAbstractionStarter]: For program point L43(lines 30 66) no Hoare annotation was computed. [2019-10-07 13:40:07,288 INFO L439 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2019-10-07 13:40:07,289 INFO L439 ceAbstractionStarter]: At program point L35-1(line 35) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2019-10-07 13:40:07,289 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:40:07,289 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:40:07,289 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:40:07,289 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:40:07,289 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:40:07,290 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:40:07,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:40:07 BoogieIcfgContainer [2019-10-07 13:40:07,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:40:07,310 INFO L168 Benchmark]: Toolchain (without parser) took 4240.63 ms. Allocated memory was 140.0 MB in the beginning and 243.8 MB in the end (delta: 103.8 MB). Free memory was 104.7 MB in the beginning and 166.6 MB in the end (delta: -61.9 MB). Peak memory consumption was 110.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:07,311 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-07 13:40:07,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.23 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 104.5 MB in the beginning and 182.3 MB in the end (delta: -77.8 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:07,313 INFO L168 Benchmark]: Boogie Preprocessor took 41.99 ms. Allocated memory is still 202.9 MB. Free memory was 182.3 MB in the beginning and 180.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:07,314 INFO L168 Benchmark]: RCFGBuilder took 427.01 ms. Allocated memory is still 202.9 MB. Free memory was 180.0 MB in the beginning and 161.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:07,315 INFO L168 Benchmark]: TraceAbstraction took 3365.18 ms. Allocated memory was 202.9 MB in the beginning and 243.8 MB in the end (delta: 40.9 MB). Free memory was 161.4 MB in the beginning and 166.6 MB in the end (delta: -5.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 GB. [2019-10-07 13:40:07,319 INFO L335 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 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 396.23 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 104.5 MB in the beginning and 182.3 MB in the end (delta: -77.8 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.99 ms. Allocated memory is still 202.9 MB. Free memory was 182.3 MB in the beginning and 180.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.01 ms. Allocated memory is still 202.9 MB. Free memory was 180.0 MB in the beginning and 161.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3365.18 ms. Allocated memory was 202.9 MB in the beginning and 243.8 MB in the end (delta: 40.9 MB). Free memory was 161.4 MB in the beginning and 166.6 MB in the end (delta: -5.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 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: ((((0 < scheme + 1 && 1 <= cp) && cp + 1 <= urilen) && 1 <= c) && c < tokenlen) || (c == 0 && (0 < scheme + 1 && 1 <= cp) && cp + 1 <= urilen) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && 1 <= cp) && cp + 1 <= urilen - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 1 error locations. Result: SAFE, OverallTime: 3.2s, OverallIterations: 7, TraceHistogramMax: 19, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 461 SDtfs, 107 SDslu, 1192 SDs, 0 SdLazy, 384 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 249 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 77 PreInvPairs, 107 NumberOfFragments, 456 HoareAnnotationTreeSize, 77 FomulaSimplifications, 215 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FomulaSimplificationsInter, 240 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 84368 SizeOfPredicates, 4 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 2729/2734 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...