/usr/bin/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-fb55353 [2019-11-07 04:00:55,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:00:55,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:00:55,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:00:55,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:00:55,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:00:55,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:00:55,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:00:55,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:00:55,525 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:00:55,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:00:55,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:00:55,529 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:00:55,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:00:55,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:00:55,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:00:55,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:00:55,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:00:55,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:00:55,537 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:00:55,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:00:55,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:00:55,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:00:55,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:00:55,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:00:55,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:00:55,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:00:55,544 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:00:55,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:00:55,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:00:55,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:00:55,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:00:55,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:00:55,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:00:55,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:00:55,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:00:55,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:00:55,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:00:55,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:00:55,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:00:55,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:00:55,555 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-11-07 04:00:55,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:00:55,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:00:55,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:00:55,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:00:55,582 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:00:55,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:00:55,582 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:00:55,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:00:55,583 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:00:55,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:00:55,583 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:00:55,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:00:55,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:00:55,584 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:00:55,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:00:55,584 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:00:55,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:00:55,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:00:55,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:00:55,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:00:55,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:00:55,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:00:55,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:00:55,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:00:55,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:00:55,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:00:55,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:00:55,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:00:55,587 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-11-07 04:00:55,871 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:00:55,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:00:55,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:00:55,893 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:00:55,894 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:00:55,894 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-11-07 04:00:55,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a839273/7dc0730f06ce4b76b83c08f7038295dc/FLAGb3943344f [2019-11-07 04:00:56,368 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:00:56,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2019-11-07 04:00:56,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a839273/7dc0730f06ce4b76b83c08f7038295dc/FLAGb3943344f [2019-11-07 04:00:56,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a839273/7dc0730f06ce4b76b83c08f7038295dc [2019-11-07 04:00:56,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:00:56,832 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:00:56,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:00:56,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:00:56,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:00:56,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:56" (1/1) ... [2019-11-07 04:00:56,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@164d1959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:56, skipping insertion in model container [2019-11-07 04:00:56,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:00:56" (1/1) ... [2019-11-07 04:00:56,874 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:00:56,912 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:00:57,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:00:57,102 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:00:57,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:00:57,137 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:00:57,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:57 WrapperNode [2019-11-07 04:00:57,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:00:57,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:00:57,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:00:57,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:00:57,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:57" (1/1) ... [2019-11-07 04:00:57,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:57" (1/1) ... [2019-11-07 04:00:57,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:57" (1/1) ... [2019-11-07 04:00:57,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:57" (1/1) ... [2019-11-07 04:00:57,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:57" (1/1) ... [2019-11-07 04:00:57,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:57" (1/1) ... [2019-11-07 04:00:57,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:57" (1/1) ... [2019-11-07 04:00:57,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:00:57,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:00:57,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:00:57,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:00:57,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:57" (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-11-07 04:00:57,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:00:57,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:00:57,319 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 04:00:57,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:00:57,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:00:57,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:00:57,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 04:00:57,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 04:00:57,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:00:57,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:00:57,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:00:57,701 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:00:57,701 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-07 04:00:57,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:00:57 BoogieIcfgContainer [2019-11-07 04:00:57,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:00:57,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:00:57,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:00:57,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:00:57,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:00:56" (1/3) ... [2019-11-07 04:00:57,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c64123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:00:57, skipping insertion in model container [2019-11-07 04:00:57,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:00:57" (2/3) ... [2019-11-07 04:00:57,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c64123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:00:57, skipping insertion in model container [2019-11-07 04:00:57,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:00:57" (3/3) ... [2019-11-07 04:00:57,711 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2019-11-07 04:00:57,722 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:00:57,730 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:00:57,742 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:00:57,769 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:00:57,769 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:00:57,769 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:00:57,769 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:00:57,769 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:00:57,770 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:00:57,770 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:00:57,770 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:00:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-07 04:00:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 04:00:57,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:00:57,795 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:00:57,797 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:00:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:00:57,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1277279000, now seen corresponding path program 1 times [2019-11-07 04:00:57,809 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:00:57,809 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982612975] [2019-11-07 04:00:57,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:00:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:00:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:00:58,000 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982612975] [2019-11-07 04:00:58,001 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:00:58,001 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:00:58,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518576749] [2019-11-07 04:00:58,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:00:58,009 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:00:58,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:00:58,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:00:58,028 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2019-11-07 04:00:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:00:58,279 INFO L93 Difference]: Finished difference Result 111 states and 201 transitions. [2019-11-07 04:00:58,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 04:00:58,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-07 04:00:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:00:58,299 INFO L225 Difference]: With dead ends: 111 [2019-11-07 04:00:58,300 INFO L226 Difference]: Without dead ends: 63 [2019-11-07 04:00:58,310 INFO L630 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-11-07 04:00:58,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-07 04:00:58,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2019-11-07 04:00:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-07 04:00:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2019-11-07 04:00:58,413 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2019-11-07 04:00:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:00:58,414 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2019-11-07 04:00:58,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:00:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2019-11-07 04:00:58,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 04:00:58,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:00:58,419 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:00:58,420 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:00:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:00:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1256946511, now seen corresponding path program 1 times [2019-11-07 04:00:58,421 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:00:58,422 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502601837] [2019-11-07 04:00:58,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:00:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:00:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:00:58,524 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502601837] [2019-11-07 04:00:58,528 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:00:58,528 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:00:58,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974694710] [2019-11-07 04:00:58,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:00:58,530 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:00:58,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:00:58,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:00:58,533 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 6 states. [2019-11-07 04:00:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:00:58,783 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2019-11-07 04:00:58,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:00:58,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-07 04:00:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:00:58,788 INFO L225 Difference]: With dead ends: 62 [2019-11-07 04:00:58,788 INFO L226 Difference]: Without dead ends: 60 [2019-11-07 04:00:58,789 INFO L630 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-11-07 04:00:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-07 04:00:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-07 04:00:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-07 04:00:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2019-11-07 04:00:58,806 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2019-11-07 04:00:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:00:58,806 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2019-11-07 04:00:58,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:00:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2019-11-07 04:00:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-07 04:00:58,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:00:58,809 INFO L410 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-11-07 04:00:58,809 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:00:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:00:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2142639325, now seen corresponding path program 1 times [2019-11-07 04:00:58,810 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:00:58,811 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111510930] [2019-11-07 04:00:58,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:00:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:00:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-07 04:00:58,880 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111510930] [2019-11-07 04:00:58,880 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:00:58,880 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:00:58,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342582627] [2019-11-07 04:00:58,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:00:58,882 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:00:58,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:00:58,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:00:58,882 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand 3 states. [2019-11-07 04:00:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:00:58,914 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2019-11-07 04:00:58,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:00:58,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-07 04:00:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:00:58,916 INFO L225 Difference]: With dead ends: 89 [2019-11-07 04:00:58,917 INFO L226 Difference]: Without dead ends: 60 [2019-11-07 04:00:58,918 INFO L630 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-11-07 04:00:58,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-07 04:00:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-07 04:00:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-07 04:00:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2019-11-07 04:00:58,931 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2019-11-07 04:00:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:00:58,932 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2019-11-07 04:00:58,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:00:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2019-11-07 04:00:58,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 04:00:58,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:00:58,934 INFO L410 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-11-07 04:00:58,935 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:00:58,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:00:58,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1689114790, now seen corresponding path program 1 times [2019-11-07 04:00:58,935 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:00:58,936 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081009273] [2019-11-07 04:00:58,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:00:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:00:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-07 04:00:59,026 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081009273] [2019-11-07 04:00:59,026 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:00:59,026 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:00:59,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886641223] [2019-11-07 04:00:59,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:00:59,027 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:00:59,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:00:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:00:59,028 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2019-11-07 04:00:59,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:00:59,166 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-11-07 04:00:59,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:00:59,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-07 04:00:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:00:59,168 INFO L225 Difference]: With dead ends: 67 [2019-11-07 04:00:59,168 INFO L226 Difference]: Without dead ends: 65 [2019-11-07 04:00:59,169 INFO L630 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-11-07 04:00:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-07 04:00:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-11-07 04:00:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-07 04:00:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2019-11-07 04:00:59,181 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2019-11-07 04:00:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:00:59,182 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2019-11-07 04:00:59,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:00:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2019-11-07 04:00:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-07 04:00:59,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:00:59,186 INFO L410 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-11-07 04:00:59,186 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:00:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:00:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1728052911, now seen corresponding path program 1 times [2019-11-07 04:00:59,187 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:00:59,187 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424511501] [2019-11-07 04:00:59,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:00:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:00:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-11-07 04:00:59,350 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424511501] [2019-11-07 04:00:59,350 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:00:59,351 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 04:00:59,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102014944] [2019-11-07 04:00:59,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 04:00:59,353 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:00:59,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 04:00:59,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:00:59,354 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 7 states. [2019-11-07 04:00:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:00:59,462 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2019-11-07 04:00:59,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 04:00:59,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-07 04:00:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:00:59,465 INFO L225 Difference]: With dead ends: 83 [2019-11-07 04:00:59,465 INFO L226 Difference]: Without dead ends: 81 [2019-11-07 04:00:59,466 INFO L630 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-11-07 04:00:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-07 04:00:59,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2019-11-07 04:00:59,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-07 04:00:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2019-11-07 04:00:59,480 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 86 [2019-11-07 04:00:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:00:59,481 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2019-11-07 04:00:59,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 04:00:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2019-11-07 04:00:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-07 04:00:59,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:00:59,485 INFO L410 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-11-07 04:00:59,486 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:00:59,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:00:59,486 INFO L82 PathProgramCache]: Analyzing trace with hash -733340726, now seen corresponding path program 1 times [2019-11-07 04:00:59,486 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:00:59,486 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540433511] [2019-11-07 04:00:59,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:00:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:00:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-11-07 04:00:59,650 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540433511] [2019-11-07 04:00:59,651 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:00:59,651 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:00:59,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13017475] [2019-11-07 04:00:59,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:00:59,654 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:00:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:00:59,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:00:59,655 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand 6 states. [2019-11-07 04:00:59,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:00:59,770 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2019-11-07 04:00:59,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:00:59,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-07 04:00:59,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:00:59,773 INFO L225 Difference]: With dead ends: 81 [2019-11-07 04:00:59,773 INFO L226 Difference]: Without dead ends: 79 [2019-11-07 04:00:59,774 INFO L630 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-11-07 04:00:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-07 04:00:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-07 04:00:59,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-07 04:00:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2019-11-07 04:00:59,788 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 91 [2019-11-07 04:00:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:00:59,789 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2019-11-07 04:00:59,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:00:59,789 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2019-11-07 04:00:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 04:00:59,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:00:59,793 INFO L410 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-11-07 04:00:59,793 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:00:59,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:00:59,793 INFO L82 PathProgramCache]: Analyzing trace with hash 259979376, now seen corresponding path program 1 times [2019-11-07 04:00:59,794 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:00:59,794 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259574432] [2019-11-07 04:00:59,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:00:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:00:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2019-11-07 04:00:59,948 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259574432] [2019-11-07 04:00:59,948 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218621035] [2019-11-07 04:00:59,949 INFO L94 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-11-07 04:01:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:01:00,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-07 04:01:00,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 04:01:00,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 04:01:00,165 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-07 04:01:00,165 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 04:01:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-07 04:01:00,254 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 04:01:00,254 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2019-11-07 04:01:00,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921649618] [2019-11-07 04:01:00,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 04:01:00,255 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:01:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 04:01:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-07 04:01:00,256 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 8 states. [2019-11-07 04:01:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:01:00,364 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2019-11-07 04:01:00,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 04:01:00,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 120 [2019-11-07 04:01:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:01:00,366 INFO L225 Difference]: With dead ends: 82 [2019-11-07 04:01:00,366 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 04:01:00,370 INFO L630 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-11-07 04:01:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 04:01:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 04:01:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 04:01:00,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 04:01:00,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2019-11-07 04:01:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:01:00,371 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 04:01:00,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 04:01:00,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 04:01:00,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 04:01:00,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 04:01:00,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 04:01:01,026 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 04:01:01,026 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:01,026 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 04:01:01,027 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 04:01:01,027 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 04:01:01,027 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 04:01:01,027 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 69) no Hoare annotation was computed. [2019-11-07 04:01:01,027 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-07 04:01:01,027 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-07 04:01:01,028 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-11-07 04:01:01,028 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-11-07 04:01:01,028 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-11-07 04:01:01,028 INFO L443 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-11-07 04:01:01,028 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-11-07 04:01:01,029 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-11-07 04:01:01,030 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-07 04:01:01,031 INFO L443 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-11-07 04:01:01,031 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2019-11-07 04:01:01,031 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 69) no Hoare annotation was computed. [2019-11-07 04:01:01,031 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 66) no Hoare annotation was computed. [2019-11-07 04:01:01,031 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 69) the Hoare annotation is: true [2019-11-07 04:01:01,031 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2019-11-07 04:01:01,031 INFO L443 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2019-11-07 04:01:01,032 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 55 61) no Hoare annotation was computed. [2019-11-07 04:01:01,032 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2019-11-07 04:01:01,032 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-11-07 04:01:01,034 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-11-07 04:01:01,034 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-11-07 04:01:01,034 INFO L443 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2019-11-07 04:01:01,034 INFO L443 ceAbstractionStarter]: For program point L40(lines 30 66) no Hoare annotation was computed. [2019-11-07 04:01:01,034 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-11-07 04:01:01,035 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-11-07 04:01:01,035 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-11-07 04:01:01,035 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-11-07 04:01:01,035 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-11-07 04:01:01,035 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-11-07 04:01:01,036 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-11-07 04:01:01,036 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-11-07 04:01:01,036 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-11-07 04:01:01,037 INFO L446 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: true [2019-11-07 04:01:01,037 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-07 04:01:01,037 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-11-07 04:01:01,037 INFO L443 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-11-07 04:01:01,037 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-11-07 04:01:01,037 INFO L443 ceAbstractionStarter]: For program point L43(lines 30 66) no Hoare annotation was computed. [2019-11-07 04:01:01,038 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-11-07 04:01:01,038 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-11-07 04:01:01,038 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-11-07 04:01:01,038 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-11-07 04:01:01,038 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-07 04:01:01,038 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-07 04:01:01,039 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-07 04:01:01,039 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-11-07 04:01:01,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:01:01 BoogieIcfgContainer [2019-11-07 04:01:01,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 04:01:01,087 INFO L168 Benchmark]: Toolchain (without parser) took 4254.61 ms. Allocated memory was 145.2 MB in the beginning and 246.9 MB in the end (delta: 101.7 MB). Free memory was 101.9 MB in the beginning and 183.3 MB in the end (delta: -81.4 MB). Peak memory consumption was 109.7 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:01,088 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-07 04:01:01,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.82 ms. Allocated memory is still 145.2 MB. Free memory was 101.7 MB in the beginning and 91.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:01,090 INFO L168 Benchmark]: Boogie Preprocessor took 117.07 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 91.6 MB in the beginning and 179.6 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:01,091 INFO L168 Benchmark]: RCFGBuilder took 447.21 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 161.2 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:01,092 INFO L168 Benchmark]: TraceAbstraction took 3380.08 ms. Allocated memory was 201.9 MB in the beginning and 246.9 MB in the end (delta: 45.1 MB). Free memory was 161.2 MB in the beginning and 183.3 MB in the end (delta: -22.1 MB). Peak memory consumption was 112.3 MB. Max. memory is 7.1 GB. [2019-11-07 04:01:01,096 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 302.82 ms. Allocated memory is still 145.2 MB. Free memory was 101.7 MB in the beginning and 91.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.07 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 91.6 MB in the beginning and 179.6 MB in the end (delta: -87.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 447.21 ms. Allocated memory is still 201.9 MB. Free memory was 179.6 MB in the beginning and 161.2 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3380.08 ms. Allocated memory was 201.9 MB in the beginning and 246.9 MB in the end (delta: 45.1 MB). Free memory was 161.2 MB in the beginning and 183.3 MB in the end (delta: -22.1 MB). Peak memory consumption was 112.3 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.5s 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.3s 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...