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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:05:01,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:05:01,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:05:01,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:05:01,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:05:01,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:05:01,287 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:05:01,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:05:01,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:05:01,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:05:01,295 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:05:01,296 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:05:01,296 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:05:01,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:05:01,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:05:01,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:05:01,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:05:01,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:05:01,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:05:01,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:05:01,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:05:01,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:05:01,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:05:01,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:05:01,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:05:01,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:05:01,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:05:01,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:05:01,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:05:01,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:05:01,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:05:01,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:05:01,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:05:01,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:05:01,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:05:01,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:05:01,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:05:01,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:05:01,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:05:01,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:05:01,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:05:01,328 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-15 01:05:01,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:05:01,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:05:01,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:05:01,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:05:01,353 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:05:01,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:05:01,353 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:05:01,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:05:01,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:05:01,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:05:01,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:05:01,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:05:01,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:05:01,355 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:05:01,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:05:01,356 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:05:01,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:05:01,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:05:01,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:05:01,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:05:01,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:05:01,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:01,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:05:01,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:05:01,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:05:01,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:05:01,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:05:01,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:05:01,358 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:05:01,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:05:01,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:05:01,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:05:01,627 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:05:01,627 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:05:01,628 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2019-10-15 01:05:01,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f04e2008/4d7cf738b23542ecb8a1605141689752/FLAG0b6979f43 [2019-10-15 01:05:02,149 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:05:02,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i [2019-10-15 01:05:02,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f04e2008/4d7cf738b23542ecb8a1605141689752/FLAG0b6979f43 [2019-10-15 01:05:02,528 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f04e2008/4d7cf738b23542ecb8a1605141689752 [2019-10-15 01:05:02,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:05:02,539 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:05:02,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:02,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:05:02,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:05:02,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@138985dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02, skipping insertion in model container [2019-10-15 01:05:02,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,556 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:05:02,574 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:05:02,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:02,761 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:05:02,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:02,815 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:05:02,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02 WrapperNode [2019-10-15 01:05:02,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:02,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:05:02,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:05:02,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:05:02,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (1/1) ... [2019-10-15 01:05:02,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:05:02,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:05:02,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:05:02,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:05:02,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (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-15 01:05:02,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:05:02,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:05:02,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:05:02,999 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:05:02,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:05:02,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:05:02,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:05:02,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:05:03,000 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:05:03,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:05:03,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:05:03,278 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:05:03,278 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-15 01:05:03,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:03 BoogieIcfgContainer [2019-10-15 01:05:03,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:05:03,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:05:03,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:05:03,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:05:03,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:05:02" (1/3) ... [2019-10-15 01:05:03,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2a6fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:03, skipping insertion in model container [2019-10-15 01:05:03,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:02" (2/3) ... [2019-10-15 01:05:03,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2a6fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:03, skipping insertion in model container [2019-10-15 01:05:03,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:03" (3/3) ... [2019-10-15 01:05:03,300 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i [2019-10-15 01:05:03,308 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:05:03,315 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:05:03,324 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:05:03,347 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:05:03,347 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:05:03,347 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:05:03,347 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:05:03,348 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:05:03,348 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:05:03,348 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:05:03,348 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:05:03,366 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-15 01:05:03,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 01:05:03,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:03,373 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:03,374 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:03,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2074932940, now seen corresponding path program 1 times [2019-10-15 01:05:03,388 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:03,388 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044208939] [2019-10-15 01:05:03,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:03,484 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-15 01:05:03,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044208939] [2019-10-15 01:05:03,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:03,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:05:03,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437808055] [2019-10-15 01:05:03,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:05:03,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:03,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:05:03,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:05:03,505 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-15 01:05:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:03,537 INFO L93 Difference]: Finished difference Result 87 states and 156 transitions. [2019-10-15 01:05:03,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:05:03,539 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-15 01:05:03,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:03,549 INFO L225 Difference]: With dead ends: 87 [2019-10-15 01:05:03,550 INFO L226 Difference]: Without dead ends: 42 [2019-10-15 01:05:03,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:05:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-15 01:05:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-10-15 01:05:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-15 01:05:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-10-15 01:05:03,608 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 12 [2019-10-15 01:05:03,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:03,609 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-10-15 01:05:03,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:05:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-10-15 01:05:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 01:05:03,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:03,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:03,611 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:03,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:03,612 INFO L82 PathProgramCache]: Analyzing trace with hash -132543993, now seen corresponding path program 1 times [2019-10-15 01:05:03,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:03,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607288624] [2019-10-15 01:05:03,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:03,730 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-15 01:05:03,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607288624] [2019-10-15 01:05:03,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:03,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:03,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113104045] [2019-10-15 01:05:03,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:03,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:03,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:03,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:03,736 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-10-15 01:05:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:03,943 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2019-10-15 01:05:03,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:03,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-10-15 01:05:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:03,945 INFO L225 Difference]: With dead ends: 48 [2019-10-15 01:05:03,946 INFO L226 Difference]: Without dead ends: 46 [2019-10-15 01:05:03,947 INFO L600 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-15 01:05:03,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-15 01:05:03,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-15 01:05:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:05:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-10-15 01:05:03,962 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 13 [2019-10-15 01:05:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:03,962 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-10-15 01:05:03,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-10-15 01:05:03,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 01:05:03,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:03,964 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:03,965 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:03,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:03,965 INFO L82 PathProgramCache]: Analyzing trace with hash -811261734, now seen corresponding path program 1 times [2019-10-15 01:05:03,966 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:03,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373309614] [2019-10-15 01:05:03,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,966 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:03,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,023 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-15 01:05:04,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373309614] [2019-10-15 01:05:04,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:05:04,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642677244] [2019-10-15 01:05:04,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:05:04,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:05:04,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:05:04,031 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 5 states. [2019-10-15 01:05:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,116 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-10-15 01:05:04,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:05:04,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-15 01:05:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,118 INFO L225 Difference]: With dead ends: 52 [2019-10-15 01:05:04,118 INFO L226 Difference]: Without dead ends: 40 [2019-10-15 01:05:04,119 INFO L600 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-15 01:05:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-15 01:05:04,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-15 01:05:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-15 01:05:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-10-15 01:05:04,128 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2019-10-15 01:05:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,128 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-10-15 01:05:04,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:05:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-10-15 01:05:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:05:04,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,130 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:04,130 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1679618026, now seen corresponding path program 1 times [2019-10-15 01:05:04,131 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358548972] [2019-10-15 01:05:04,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,233 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-15 01:05:04,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358548972] [2019-10-15 01:05:04,234 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:04,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:05:04,234 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671251049] [2019-10-15 01:05:04,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:05:04,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:04,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:05:04,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:05:04,238 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2019-10-15 01:05:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:04,346 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2019-10-15 01:05:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:05:04,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-10-15 01:05:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:04,350 INFO L225 Difference]: With dead ends: 55 [2019-10-15 01:05:04,350 INFO L226 Difference]: Without dead ends: 53 [2019-10-15 01:05:04,351 INFO L600 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-15 01:05:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-15 01:05:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-10-15 01:05:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-15 01:05:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2019-10-15 01:05:04,374 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 19 [2019-10-15 01:05:04,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:04,375 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2019-10-15 01:05:04,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:05:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2019-10-15 01:05:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-15 01:05:04,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:04,378 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:05:04,378 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2122625936, now seen corresponding path program 1 times [2019-10-15 01:05:04,380 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:04,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058442947] [2019-10-15 01:05:04,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,381 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:04,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-15 01:05:04,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058442947] [2019-10-15 01:05:04,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406878443] [2019-10-15 01:05:04,562 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-10-15 01:05:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:04,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-15 01:05:04,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:05:04,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:05:04,797 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:05:04,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:04,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:04,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:04,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:04,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:05:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-15 01:05:04,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [880646306] [2019-10-15 01:05:04,958 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 34 [2019-10-15 01:05:05,009 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:05:05,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:05:05,259 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-15 01:05:05,262 INFO L272 AbstractInterpreter]: Visited 20 different actions 133 times. Merged at 6 different actions 36 times. Widened at 1 different actions 2 times. Performed 184 root evaluator evaluations with a maximum evaluation depth of 5. Performed 184 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2019-10-15 01:05:05,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:05,268 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-15 01:05:05,268 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:05:05,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 17 [2019-10-15 01:05:05,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246565786] [2019-10-15 01:05:05,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-15 01:05:05,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:05,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-15 01:05:05,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:05:05,270 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand 17 states. [2019-10-15 01:05:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:05,504 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2019-10-15 01:05:05,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:05,504 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2019-10-15 01:05:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:05,505 INFO L225 Difference]: With dead ends: 51 [2019-10-15 01:05:05,506 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:05:05,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:05:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:05:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:05:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:05:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:05:05,510 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-10-15 01:05:05,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:05,511 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:05:05,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-15 01:05:05,511 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:05:05,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:05:05,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:05:05,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:05:05,910 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 01:05:05,910 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:05,910 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:05:05,910 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:05:05,911 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:05:05,911 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:05:05,911 INFO L439 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0) (not (= main_~tagbuf_len~0 main_~t~0))) [2019-10-15 01:05:05,911 INFO L446 ceAbstractionStarter]: At program point L60(lines 11 63) the Hoare annotation is: true [2019-10-15 01:05:05,912 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0) (not (= main_~tagbuf_len~0 main_~t~0))) [2019-10-15 01:05:05,912 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0) (not (= main_~tagbuf_len~0 main_~t~0))) [2019-10-15 01:05:05,912 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 63) no Hoare annotation was computed. [2019-10-15 01:05:05,912 INFO L443 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2019-10-15 01:05:05,912 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 54) no Hoare annotation was computed. [2019-10-15 01:05:05,913 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 23) no Hoare annotation was computed. [2019-10-15 01:05:05,913 INFO L443 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-10-15 01:05:05,913 INFO L443 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-10-15 01:05:05,913 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 54) no Hoare annotation was computed. [2019-10-15 01:05:05,913 INFO L439 ceAbstractionStarter]: At program point L40-1(lines 40 54) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0) (not (= main_~tagbuf_len~0 main_~t~0))) [2019-10-15 01:05:05,914 INFO L439 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2019-10-15 01:05:05,914 INFO L439 ceAbstractionStarter]: At program point L36-1(line 36) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2019-10-15 01:05:05,914 INFO L443 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-10-15 01:05:05,914 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-15 01:05:05,914 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-10-15 01:05:05,915 INFO L439 ceAbstractionStarter]: At program point L20(line 20) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2019-10-15 01:05:05,915 INFO L439 ceAbstractionStarter]: At program point L20-1(line 20) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2019-10-15 01:05:05,915 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 49) no Hoare annotation was computed. [2019-10-15 01:05:05,915 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 50) no Hoare annotation was computed. [2019-10-15 01:05:05,915 INFO L439 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2019-10-15 01:05:05,915 INFO L439 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2019-10-15 01:05:05,916 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 63) no Hoare annotation was computed. [2019-10-15 01:05:05,916 INFO L439 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0) (not (= main_~tagbuf_len~0 main_~t~0))) [2019-10-15 01:05:05,916 INFO L439 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0) (not (= main_~tagbuf_len~0 main_~t~0))) [2019-10-15 01:05:05,916 INFO L439 ceAbstractionStarter]: At program point L34-2(lines 34 58) the Hoare annotation is: (and (<= 1 main_~tagbuf_len~0) (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2019-10-15 01:05:05,917 INFO L439 ceAbstractionStarter]: At program point L34-3(lines 34 58) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0) (not (= main_~tagbuf_len~0 main_~t~0))) [2019-10-15 01:05:05,917 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 63) the Hoare annotation is: true [2019-10-15 01:05:05,917 INFO L439 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0) (not (= main_~tagbuf_len~0 main_~t~0))) [2019-10-15 01:05:05,917 INFO L439 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0) (not (= main_~tagbuf_len~0 main_~t~0))) [2019-10-15 01:05:05,918 INFO L439 ceAbstractionStarter]: At program point L18-2(lines 18 30) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0)) [2019-10-15 01:05:05,918 INFO L439 ceAbstractionStarter]: At program point L18-3(lines 18 30) the Hoare annotation is: (and (<= main_~t~0 main_~tagbuf_len~0) (<= 0 main_~t~0) (not (= main_~tagbuf_len~0 main_~t~0))) [2019-10-15 01:05:05,918 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-15 01:05:05,918 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-10-15 01:05:05,918 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-15 01:05:05,918 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-15 01:05:05,919 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-15 01:05:05,919 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-15 01:05:05,919 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-15 01:05:05,919 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-15 01:05:05,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:05:05 BoogieIcfgContainer [2019-10-15 01:05:05,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:05:05,934 INFO L168 Benchmark]: Toolchain (without parser) took 3393.44 ms. Allocated memory was 145.2 MB in the beginning and 235.4 MB in the end (delta: 90.2 MB). Free memory was 101.7 MB in the beginning and 87.6 MB in the end (delta: 14.1 MB). Peak memory consumption was 104.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:05,935 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.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:05:05,936 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.76 ms. Allocated memory is still 145.2 MB. Free memory was 101.5 MB in the beginning and 91.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:05,937 INFO L168 Benchmark]: Boogie Preprocessor took 128.46 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.5 MB in the beginning and 181.2 MB in the end (delta: -89.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:05,938 INFO L168 Benchmark]: RCFGBuilder took 335.50 ms. Allocated memory is still 202.9 MB. Free memory was 181.2 MB in the beginning and 165.3 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:05,939 INFO L168 Benchmark]: TraceAbstraction took 2643.42 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 165.3 MB in the beginning and 87.6 MB in the end (delta: 77.7 MB). Peak memory consumption was 110.2 MB. Max. memory is 7.1 GB. [2019-10-15 01:05:05,947 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.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 275.76 ms. Allocated memory is still 145.2 MB. Free memory was 101.5 MB in the beginning and 91.5 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 128.46 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 91.5 MB in the beginning and 181.2 MB in the end (delta: -89.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 335.50 ms. Allocated memory is still 202.9 MB. Free memory was 181.2 MB in the beginning and 165.3 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2643.42 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 165.3 MB in the beginning and 87.6 MB in the end (delta: 77.7 MB). Peak memory consumption was 110.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: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: t <= tagbuf_len && 0 <= t - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (1 <= tagbuf_len && t <= tagbuf_len) && 0 <= t - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 47 locations, 1 error locations. Result: SAFE, OverallTime: 2.5s, OverallIterations: 5, TraceHistogramMax: 4, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 245 SDtfs, 74 SDslu, 553 SDs, 0 SdLazy, 294 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 59 PreInvPairs, 79 NumberOfFragments, 175 HoareAnnotationTreeSize, 59 FomulaSimplifications, 11 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 11020 SizeOfPredicates, 4 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 46/73 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...