/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:34:24,226 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:34:24,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:34:24,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:34:24,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:34:24,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:34:24,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:34:24,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:34:24,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:34:24,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:34:24,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:34:24,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:34:24,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:34:24,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:34:24,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:34:24,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:34:24,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:34:24,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:34:24,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:34:24,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:34:24,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:34:24,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:34:24,263 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:34:24,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:34:24,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:34:24,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:34:24,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:34:24,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:34:24,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:34:24,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:34:24,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:34:24,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:34:24,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:34:24,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:34:24,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:34:24,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:34:24,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:34:24,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:34:24,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:34:24,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:34:24,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:34:24,290 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 00:34:24,312 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:34:24,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:34:24,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:34:24,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:34:24,315 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:34:24,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:34:24,315 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:34:24,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:34:24,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:34:24,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:34:24,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:34:24,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:34:24,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:34:24,318 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:34:24,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:34:24,318 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:34:24,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:34:24,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:34:24,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:34:24,319 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:34:24,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:34:24,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:34:24,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:34:24,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:34:24,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:34:24,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:34:24,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:34:24,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:34:24,321 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-11-07 00:34:24,636 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:34:24,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:34:24,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:34:24,665 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:34:24,666 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:34:24,666 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2019-11-07 00:34:24,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a02521e/567cd1e8dba043ab8395e9ab80d372a6/FLAGc9f5c0e13 [2019-11-07 00:34:25,175 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:34:25,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2019-11-07 00:34:25,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a02521e/567cd1e8dba043ab8395e9ab80d372a6/FLAGc9f5c0e13 [2019-11-07 00:34:25,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a02521e/567cd1e8dba043ab8395e9ab80d372a6 [2019-11-07 00:34:25,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:34:25,574 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:34:25,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:25,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:34:25,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:34:25,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:25" (1/1) ... [2019-11-07 00:34:25,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bb6563c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25, skipping insertion in model container [2019-11-07 00:34:25,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:25" (1/1) ... [2019-11-07 00:34:25,591 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:34:25,609 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:34:25,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:25,785 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:34:25,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:25,819 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:34:25,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25 WrapperNode [2019-11-07 00:34:25,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:25,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:34:25,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:34:25,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:34:25,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25" (1/1) ... [2019-11-07 00:34:25,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25" (1/1) ... [2019-11-07 00:34:25,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25" (1/1) ... [2019-11-07 00:34:25,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25" (1/1) ... [2019-11-07 00:34:25,845 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25" (1/1) ... [2019-11-07 00:34:25,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25" (1/1) ... [2019-11-07 00:34:25,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25" (1/1) ... [2019-11-07 00:34:25,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:34:25,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:34:25,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:34:25,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:34:25,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25" (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 00:34:25,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:34:25,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:34:25,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 00:34:25,990 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:34:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:34:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:34:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:34:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:34:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:34:25,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:34:25,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:34:26,211 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:34:26,211 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-07 00:34:26,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:26 BoogieIcfgContainer [2019-11-07 00:34:26,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:34:26,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:34:26,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:34:26,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:34:26,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:34:25" (1/3) ... [2019-11-07 00:34:26,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14239935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:26, skipping insertion in model container [2019-11-07 00:34:26,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:25" (2/3) ... [2019-11-07 00:34:26,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14239935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:26, skipping insertion in model container [2019-11-07 00:34:26,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:26" (3/3) ... [2019-11-07 00:34:26,245 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-11-07 00:34:26,273 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:34:26,290 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:34:26,303 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:34:26,342 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:34:26,343 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:34:26,343 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:34:26,343 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:34:26,343 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:34:26,343 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:34:26,343 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:34:26,344 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:34:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-07 00:34:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:34:26,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:26,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:26,367 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:26,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1213508388, now seen corresponding path program 1 times [2019-11-07 00:34:26,380 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:26,380 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049442630] [2019-11-07 00:34:26,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:26,560 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 00:34:26,561 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049442630] [2019-11-07 00:34:26,562 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:26,562 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:26,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511114383] [2019-11-07 00:34:26,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:26,570 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:26,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:26,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:26,588 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-11-07 00:34:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:26,724 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2019-11-07 00:34:26,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:26,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-07 00:34:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:26,735 INFO L225 Difference]: With dead ends: 57 [2019-11-07 00:34:26,735 INFO L226 Difference]: Without dead ends: 28 [2019-11-07 00:34:26,739 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 00:34:26,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-07 00:34:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-07 00:34:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-07 00:34:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-07 00:34:26,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2019-11-07 00:34:26,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:26,787 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-07 00:34:26,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-07 00:34:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 00:34:26,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:26,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:26,789 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash 542305890, now seen corresponding path program 1 times [2019-11-07 00:34:26,790 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:26,791 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298057031] [2019-11-07 00:34:26,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:26,859 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 00:34:26,860 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298057031] [2019-11-07 00:34:26,860 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:26,860 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:34:26,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545436221] [2019-11-07 00:34:26,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:34:26,863 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:26,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:34:26,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:26,864 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-11-07 00:34:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:27,046 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-07 00:34:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:34:27,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-07 00:34:27,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:27,049 INFO L225 Difference]: With dead ends: 40 [2019-11-07 00:34:27,049 INFO L226 Difference]: Without dead ends: 38 [2019-11-07 00:34:27,051 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 00:34:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-07 00:34:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-11-07 00:34:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-07 00:34:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-07 00:34:27,070 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2019-11-07 00:34:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:27,071 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-07 00:34:27,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:34:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-07 00:34:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:34:27,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:27,074 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:27,074 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:27,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1063580357, now seen corresponding path program 1 times [2019-11-07 00:34:27,075 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:27,075 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404430641] [2019-11-07 00:34:27,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:27,177 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 00:34:27,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404430641] [2019-11-07 00:34:27,178 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:27,178 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:34:27,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968116033] [2019-11-07 00:34:27,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:34:27,179 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:27,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:34:27,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:34:27,181 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2019-11-07 00:34:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:27,258 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-11-07 00:34:27,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:27,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-07 00:34:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:27,262 INFO L225 Difference]: With dead ends: 45 [2019-11-07 00:34:27,262 INFO L226 Difference]: Without dead ends: 43 [2019-11-07 00:34:27,263 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 00:34:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-07 00:34:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-07 00:34:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-07 00:34:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-11-07 00:34:27,283 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 20 [2019-11-07 00:34:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:27,283 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-11-07 00:34:27,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:34:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-11-07 00:34:27,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 00:34:27,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:27,287 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:27,288 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:27,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:27,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1462671860, now seen corresponding path program 1 times [2019-11-07 00:34:27,289 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:27,289 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044163227] [2019-11-07 00:34:27,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:27,395 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044163227] [2019-11-07 00:34:27,395 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:27,395 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 00:34:27,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987835910] [2019-11-07 00:34:27,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:34:27,396 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:27,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:34:27,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:27,397 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2019-11-07 00:34:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:27,566 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2019-11-07 00:34:27,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:34:27,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-07 00:34:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:27,569 INFO L225 Difference]: With dead ends: 68 [2019-11-07 00:34:27,569 INFO L226 Difference]: Without dead ends: 66 [2019-11-07 00:34:27,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:34:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-07 00:34:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-11-07 00:34:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-07 00:34:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-11-07 00:34:27,586 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 24 [2019-11-07 00:34:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:27,586 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-11-07 00:34:27,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:34:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-11-07 00:34:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-07 00:34:27,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:27,590 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:27,590 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash -965699220, now seen corresponding path program 1 times [2019-11-07 00:34:27,591 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:27,591 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214517382] [2019-11-07 00:34:27,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:27,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214517382] [2019-11-07 00:34:27,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620674258] [2019-11-07 00:34:27,706 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 00:34:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:27,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 00:34:27,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-07 00:34:27,884 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:27,949 INFO L218 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-07 00:34:27,949 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [9] total 13 [2019-11-07 00:34:27,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361341650] [2019-11-07 00:34:27,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:34:27,950 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:27,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:34:27,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:34:27,952 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 7 states. [2019-11-07 00:34:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:28,530 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2019-11-07 00:34:28,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:34:28,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-07 00:34:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:28,532 INFO L225 Difference]: With dead ends: 111 [2019-11-07 00:34:28,532 INFO L226 Difference]: Without dead ends: 73 [2019-11-07 00:34:28,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:34:28,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-07 00:34:28,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2019-11-07 00:34:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-07 00:34:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-11-07 00:34:28,545 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 27 [2019-11-07 00:34:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:28,545 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-11-07 00:34:28,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:34:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-11-07 00:34:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:34:28,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:28,547 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-07 00:34:28,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:28,750 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1830678608, now seen corresponding path program 1 times [2019-11-07 00:34:28,751 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:28,752 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802423159] [2019-11-07 00:34:28,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 00:34:28,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802423159] [2019-11-07 00:34:28,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205542132] [2019-11-07 00:34:28,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:28,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 00:34:28,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 00:34:28,927 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 00:34:28,968 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1397087221] [2019-11-07 00:34:28,975 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 32 [2019-11-07 00:34:29,016 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:34:29,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:34:29,233 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:34:29,236 INFO L272 AbstractInterpreter]: Visited 26 different actions 140 times. Merged at 9 different actions 33 times. Widened at 2 different actions 3 times. Performed 202 root evaluator evaluations with a maximum evaluation depth of 5. Performed 202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 6 fixpoints after 3 different actions. Largest state had 9 variables. [2019-11-07 00:34:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:29,242 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:34:29,243 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:29,243 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2019-11-07 00:34:29,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941931066] [2019-11-07 00:34:29,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-07 00:34:29,244 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:29,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-07 00:34:29,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-07 00:34:29,245 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 9 states. [2019-11-07 00:34:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:29,448 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2019-11-07 00:34:29,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-07 00:34:29,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-07 00:34:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:29,449 INFO L225 Difference]: With dead ends: 80 [2019-11-07 00:34:29,449 INFO L226 Difference]: Without dead ends: 55 [2019-11-07 00:34:29,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:34:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-07 00:34:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2019-11-07 00:34:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-07 00:34:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-11-07 00:34:29,462 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 31 [2019-11-07 00:34:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:29,465 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-11-07 00:34:29,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-07 00:34:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-11-07 00:34:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-07 00:34:29,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:29,466 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-07 00:34:29,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:29,671 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:29,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1063418416, now seen corresponding path program 1 times [2019-11-07 00:34:29,672 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:29,672 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333347645] [2019-11-07 00:34:29,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 00:34:29,818 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333347645] [2019-11-07 00:34:29,819 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114645757] [2019-11-07 00:34:29,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:29,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-07 00:34:29,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-07 00:34:29,973 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-07 00:34:30,030 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [87035546] [2019-11-07 00:34:30,030 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 35 [2019-11-07 00:34:30,032 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:34:30,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:34:30,135 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:34:30,135 INFO L272 AbstractInterpreter]: Visited 28 different actions 239 times. Merged at 12 different actions 71 times. Widened at 4 different actions 11 times. Performed 375 root evaluator evaluations with a maximum evaluation depth of 5. Performed 375 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 17 fixpoints after 5 different actions. Largest state had 10 variables. [2019-11-07 00:34:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:30,136 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:34:30,136 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:30,136 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2019-11-07 00:34:30,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766282643] [2019-11-07 00:34:30,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-07 00:34:30,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-07 00:34:30,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-07 00:34:30,138 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 16 states. [2019-11-07 00:34:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:30,615 INFO L93 Difference]: Finished difference Result 120 states and 153 transitions. [2019-11-07 00:34:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 00:34:30,618 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2019-11-07 00:34:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:30,619 INFO L225 Difference]: With dead ends: 120 [2019-11-07 00:34:30,619 INFO L226 Difference]: Without dead ends: 86 [2019-11-07 00:34:30,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-11-07 00:34:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-07 00:34:30,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2019-11-07 00:34:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-07 00:34:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2019-11-07 00:34:30,637 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 34 [2019-11-07 00:34:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:30,638 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2019-11-07 00:34:30,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-07 00:34:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2019-11-07 00:34:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-07 00:34:30,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:30,641 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:30,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:30,842 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1968312716, now seen corresponding path program 2 times [2019-11-07 00:34:30,844 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:30,844 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239156377] [2019-11-07 00:34:30,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:34:30,920 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239156377] [2019-11-07 00:34:30,920 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607515669] [2019-11-07 00:34:30,920 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:30,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-07 00:34:30,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:34:30,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-07 00:34:30,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:30,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:34:31,036 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:34:31,080 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1033582898] [2019-11-07 00:34:31,081 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:34:31,081 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:34:31,081 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:31,081 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 13 [2019-11-07 00:34:31,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809279260] [2019-11-07 00:34:31,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-07 00:34:31,083 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:31,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-07 00:34:31,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:34:31,083 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 13 states. [2019-11-07 00:34:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:31,443 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2019-11-07 00:34:31,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-07 00:34:31,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-11-07 00:34:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:31,446 INFO L225 Difference]: With dead ends: 87 [2019-11-07 00:34:31,446 INFO L226 Difference]: Without dead ends: 85 [2019-11-07 00:34:31,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2019-11-07 00:34:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-07 00:34:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-11-07 00:34:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-07 00:34:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 74 transitions. [2019-11-07 00:34:31,461 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 74 transitions. Word has length 38 [2019-11-07 00:34:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:31,461 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-11-07 00:34:31,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-07 00:34:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2019-11-07 00:34:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-07 00:34:31,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:31,463 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 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] [2019-11-07 00:34:31,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:31,676 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:31,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1795492628, now seen corresponding path program 2 times [2019-11-07 00:34:31,677 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:31,677 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072774045] [2019-11-07 00:34:31,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:34:31,824 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072774045] [2019-11-07 00:34:31,824 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906064666] [2019-11-07 00:34:31,825 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:31,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-07 00:34:31,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:34:31,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 00:34:31,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-07 00:34:31,950 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-07 00:34:32,176 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [389101952] [2019-11-07 00:34:32,176 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:34:32,176 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:34:32,176 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:32,177 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 21 [2019-11-07 00:34:32,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925444498] [2019-11-07 00:34:32,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-07 00:34:32,178 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:32,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-07 00:34:32,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-11-07 00:34:32,179 INFO L87 Difference]: Start difference. First operand 61 states and 74 transitions. Second operand 21 states. [2019-11-07 00:34:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:37,444 INFO L93 Difference]: Finished difference Result 422 states and 619 transitions. [2019-11-07 00:34:37,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-11-07 00:34:37,445 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2019-11-07 00:34:37,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:37,449 INFO L225 Difference]: With dead ends: 422 [2019-11-07 00:34:37,449 INFO L226 Difference]: Without dead ends: 306 [2019-11-07 00:34:37,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1252, Invalid=6758, Unknown=0, NotChecked=0, Total=8010 [2019-11-07 00:34:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-07 00:34:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 96. [2019-11-07 00:34:37,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-07 00:34:37,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-11-07 00:34:37,490 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 41 [2019-11-07 00:34:37,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:37,491 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-11-07 00:34:37,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-07 00:34:37,491 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2019-11-07 00:34:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-07 00:34:37,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:37,493 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:37,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:37,705 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:37,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash 366127920, now seen corresponding path program 3 times [2019-11-07 00:34:37,706 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:37,707 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837630733] [2019-11-07 00:34:37,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-07 00:34:37,773 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837630733] [2019-11-07 00:34:37,773 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:37,774 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:34:37,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433781964] [2019-11-07 00:34:37,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:34:37,774 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:37,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:34:37,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:34:37,775 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand 6 states. [2019-11-07 00:34:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:37,842 INFO L93 Difference]: Finished difference Result 96 states and 129 transitions. [2019-11-07 00:34:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:34:37,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-11-07 00:34:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:37,844 INFO L225 Difference]: With dead ends: 96 [2019-11-07 00:34:37,844 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:34:37,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:34:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:34:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:34:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:34:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:34:37,849 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-07 00:34:37,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:37,850 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:34:37,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:34:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:34:37,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:34:37,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:34:38,021 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2019-11-07 00:34:38,247 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 108 [2019-11-07 00:34:38,651 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 13 [2019-11-07 00:34:39,116 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 14 [2019-11-07 00:34:39,398 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 34 [2019-11-07 00:34:39,586 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 12 [2019-11-07 00:34:39,804 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 13 [2019-11-07 00:34:39,892 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 00:34:39,892 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:39,892 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:39,892 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:34:39,892 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:39,892 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:39,892 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-11-07 00:34:39,893 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-11-07 00:34:39,893 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2019-11-07 00:34:39,893 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= (+ main_~k~0 1) main_~n~0))) [2019-11-07 00:34:39,893 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2019-11-07 00:34:39,893 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2019-11-07 00:34:39,893 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse1 (<= main_~k~0 main_~n~0)) (.cse0 (<= main_~n~0 main_~k~0)) (.cse2 (<= main_~n~0 main_~j~0))) (or (and .cse0 .cse1 (<= main_~i~0 0)) (and .cse1 .cse0 .cse2) (let ((.cse3 (div (+ (- main_~n~0) 1) (- 2)))) (and (<= .cse3 0) (<= (+ .cse3 1) main_~i~0) (<= main_~k~0 main_~i~0) .cse0 .cse2)) (and (<= main_~j~0 (* 2 main_~i~0)) .cse0 .cse2))) [2019-11-07 00:34:39,893 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-11-07 00:34:39,893 INFO L443 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2019-11-07 00:34:39,893 INFO L446 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-11-07 00:34:39,893 INFO L443 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2019-11-07 00:34:39,894 INFO L439 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse1 (* 2 main_~i~0))) (let ((.cse0 (and (<= .cse1 main_~j~0) (<= main_~n~0 main_~k~0)))) (or (and (<= (* 2 main_~k~0) (+ main_~j~0 main_~n~0 1)) .cse0 (forall ((main_~n~0 Int)) (or (< (div (* main_~n~0 (- 1)) (- 2)) (+ main_~i~0 2)) (< main_~j~0 main_~n~0)))) (and .cse0 (<= main_~j~0 .cse1) (<= main_~n~0 main_~j~0)) (and (<= main_~k~0 (+ .cse1 1)) .cse0 (<= main_~i~0 0)) (and (<= main_~k~0 main_~n~0) .cse0)))) [2019-11-07 00:34:39,894 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-11-07 00:34:39,894 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2019-11-07 00:34:39,894 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2019-11-07 00:34:39,894 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0))) [2019-11-07 00:34:39,894 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-07 00:34:39,894 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-11-07 00:34:39,895 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-07 00:34:39,895 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:34:39,895 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-07 00:34:39,895 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-07 00:34:39,895 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:34:39,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-11-07 00:34:39,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-11-07 00:34:39,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-11-07 00:34:39,906 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-11-07 00:34:39,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:34:39 BoogieIcfgContainer [2019-11-07 00:34:39,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:34:39,914 INFO L168 Benchmark]: Toolchain (without parser) took 14339.68 ms. Allocated memory was 138.4 MB in the beginning and 310.4 MB in the end (delta: 172.0 MB). Free memory was 102.9 MB in the beginning and 203.7 MB in the end (delta: -100.8 MB). Peak memory consumption was 163.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:39,915 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-07 00:34:39,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.45 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 93.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:39,917 INFO L168 Benchmark]: Boogie Preprocessor took 114.14 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 93.1 MB in the beginning and 180.8 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:39,918 INFO L168 Benchmark]: RCFGBuilder took 277.68 ms. Allocated memory is still 201.9 MB. Free memory was 180.8 MB in the beginning and 167.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:39,919 INFO L168 Benchmark]: TraceAbstraction took 13697.81 ms. Allocated memory was 201.9 MB in the beginning and 310.4 MB in the end (delta: 108.5 MB). Free memory was 167.2 MB in the beginning and 203.7 MB in the end (delta: -36.5 MB). Peak memory consumption was 163.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:39,923 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.24 ms. Allocated memory is still 138.4 MB. Free memory was 120.4 MB in the beginning and 120.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 245.45 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 93.1 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.14 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 93.1 MB in the beginning and 180.8 MB in the end (delta: -87.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 277.68 ms. Allocated memory is still 201.9 MB. Free memory was 180.8 MB in the beginning and 167.8 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13697.81 ms. Allocated memory was 201.9 MB in the beginning and 310.4 MB in the end (delta: 108.5 MB). Free memory was 167.2 MB in the beginning and 203.7 MB in the end (delta: -36.5 MB). Peak memory consumption was 163.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] * 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: 20]: Loop Invariant [2019-11-07 00:34:39,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-11-07 00:34:39,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-11-07 00:34:39,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] [2019-11-07 00:34:39,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~n~0,QUANTIFIED] Derived loop invariant: ((((2 * k <= j + n + 1 && 2 * i <= j && n <= k) && (forall main_~n~0 : int :: main_~n~0 * -1 / -2 < i + 2 || j < main_~n~0)) || (((2 * i <= j && n <= k) && j <= 2 * i) && n <= j)) || ((k <= 2 * i + 1 && 2 * i <= j && n <= k) && i <= 0)) || (k <= n && 2 * i <= j && n <= k) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((j < n && 2 * i <= j) && 2 * i <= k) && k <= n - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((n <= k && k <= n) && i <= 0) || ((k <= n && n <= k) && n <= j)) || (((((-n + 1) / -2 <= 0 && (-n + 1) / -2 + 1 <= i) && k <= i) && n <= k) && n <= j)) || ((j <= 2 * i && n <= k) && n <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. Result: SAFE, OverallTime: 13.5s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, HoareTripleCheckerStatistics: 337 SDtfs, 362 SDslu, 1510 SDs, 0 SdLazy, 2039 SolverSat, 533 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 325 SyntacticMatches, 13 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2829 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=9, 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, 10 MinimizatonAttempts, 321 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 54 PreInvPairs, 140 NumberOfFragments, 223 HoareAnnotationTreeSize, 54 FomulaSimplifications, 103793 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 12 FomulaSimplificationsInter, 25412 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 462 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 613 ConstructedInterpolants, 2 QuantifiedInterpolants, 47858 SizeOfPredicates, 24 NumberOfNonLiveVariables, 356 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 256/307 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...