java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 16:43:21,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 16:43:21,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 16:43:21,275 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 16:43:21,276 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 16:43:21,277 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 16:43:21,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 16:43:21,282 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 16:43:21,284 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 16:43:21,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 16:43:21,293 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 16:43:21,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 16:43:21,294 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 16:43:21,299 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 16:43:21,300 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 16:43:21,304 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 16:43:21,305 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 16:43:21,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 16:43:21,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 16:43:21,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 16:43:21,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 16:43:21,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 16:43:21,318 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 16:43:21,319 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 16:43:21,319 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 16:43:21,320 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 16:43:21,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 16:43:21,323 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 16:43:21,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 16:43:21,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 16:43:21,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 16:43:21,328 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 16:43:21,328 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 16:43:21,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 16:43:21,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 16:43:21,330 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 16:43:21,330 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 16:43:21,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 16:43:21,358 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 16:43:21,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 16:43:21,359 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 16:43:21,360 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 16:43:21,360 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 16:43:21,360 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 16:43:21,360 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 16:43:21,360 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 16:43:21,361 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 16:43:21,361 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 16:43:21,361 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 16:43:21,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 16:43:21,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 16:43:21,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 16:43:21,364 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 16:43:21,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 16:43:21,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 16:43:21,364 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 16:43:21,364 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 16:43:21,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 16:43:21,366 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 16:43:21,366 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 16:43:21,367 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 16:43:21,367 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:43:21,367 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 16:43:21,367 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 16:43:21,367 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 16:43:21,368 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 16:43:21,368 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 16:43:21,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 16:43:21,368 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 16:43:21,368 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 16:43:21,369 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 16:43:21,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 16:43:21,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 16:43:21,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 16:43:21,439 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 16:43:21,439 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 16:43:21,440 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-07 16:43:21,505 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938a01061/3da370624d3640639a889dd3b3bf4c69/FLAG7f51dd987 [2018-11-07 16:43:21,980 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 16:43:21,982 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-07 16:43:21,989 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938a01061/3da370624d3640639a889dd3b3bf4c69/FLAG7f51dd987 [2018-11-07 16:43:22,011 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/938a01061/3da370624d3640639a889dd3b3bf4c69 [2018-11-07 16:43:22,022 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 16:43:22,024 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 16:43:22,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 16:43:22,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 16:43:22,033 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 16:43:22,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c28240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22, skipping insertion in model container [2018-11-07 16:43:22,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 16:43:22,078 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 16:43:22,273 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:43:22,277 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 16:43:22,301 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 16:43:22,318 INFO L193 MainTranslator]: Completed translation [2018-11-07 16:43:22,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22 WrapperNode [2018-11-07 16:43:22,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 16:43:22,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 16:43:22,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 16:43:22,320 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 16:43:22,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 16:43:22,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 16:43:22,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 16:43:22,351 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 16:43:22,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (1/1) ... [2018-11-07 16:43:22,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 16:43:22,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 16:43:22,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 16:43:22,403 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 16:43:22,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 16:43:22,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 16:43:22,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 16:43:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 16:43:22,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 16:43:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 16:43:22,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 16:43:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 16:43:22,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 16:43:23,102 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 16:43:23,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:43:23 BoogieIcfgContainer [2018-11-07 16:43:23,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 16:43:23,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 16:43:23,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 16:43:23,108 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 16:43:23,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:43:22" (1/3) ... [2018-11-07 16:43:23,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b72067d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:43:23, skipping insertion in model container [2018-11-07 16:43:23,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:43:22" (2/3) ... [2018-11-07 16:43:23,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b72067d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:43:23, skipping insertion in model container [2018-11-07 16:43:23,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:43:23" (3/3) ... [2018-11-07 16:43:23,111 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-11-07 16:43:23,121 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 16:43:23,130 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 16:43:23,145 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 16:43:23,179 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 16:43:23,180 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 16:43:23,180 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 16:43:23,180 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 16:43:23,180 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 16:43:23,180 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 16:43:23,180 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 16:43:23,181 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 16:43:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-07 16:43:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-07 16:43:23,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:23,210 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:23,213 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:23,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:23,220 INFO L82 PathProgramCache]: Analyzing trace with hash 64061581, now seen corresponding path program 1 times [2018-11-07 16:43:23,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:23,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:23,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:23,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:23,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:23,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:43:23,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 16:43:23,369 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:23,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 16:43:23,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 16:43:23,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 16:43:23,394 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-07 16:43:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:23,428 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-11-07 16:43:23,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 16:43:23,430 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-07 16:43:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:23,440 INFO L225 Difference]: With dead ends: 83 [2018-11-07 16:43:23,441 INFO L226 Difference]: Without dead ends: 40 [2018-11-07 16:43:23,444 INFO L604 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 [2018-11-07 16:43:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-07 16:43:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-07 16:43:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-07 16:43:23,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2018-11-07 16:43:23,491 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 15 [2018-11-07 16:43:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:23,492 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2018-11-07 16:43:23,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 16:43:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2018-11-07 16:43:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 16:43:23,493 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:23,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:23,494 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:23,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:23,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1525893932, now seen corresponding path program 1 times [2018-11-07 16:43:23,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:23,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:23,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:23,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:23,497 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:23,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:43:23,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:43:23,676 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:23,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:43:23,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:43:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:43:23,679 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 6 states. [2018-11-07 16:43:24,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:24,445 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2018-11-07 16:43:24,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:43:24,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 16:43:24,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:24,448 INFO L225 Difference]: With dead ends: 77 [2018-11-07 16:43:24,451 INFO L226 Difference]: Without dead ends: 75 [2018-11-07 16:43:24,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:43:24,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-07 16:43:24,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2018-11-07 16:43:24,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-07 16:43:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 94 transitions. [2018-11-07 16:43:24,485 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 94 transitions. Word has length 16 [2018-11-07 16:43:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:24,486 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 94 transitions. [2018-11-07 16:43:24,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:43:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 94 transitions. [2018-11-07 16:43:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-07 16:43:24,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:24,488 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:24,488 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:24,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649831, now seen corresponding path program 1 times [2018-11-07 16:43:24,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:24,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:24,490 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:24,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 16:43:24,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 16:43:24,631 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:24,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:43:24,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:43:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 16:43:24,632 INFO L87 Difference]: Start difference. First operand 62 states and 94 transitions. Second operand 6 states. [2018-11-07 16:43:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:25,230 INFO L93 Difference]: Finished difference Result 121 states and 184 transitions. [2018-11-07 16:43:25,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:43:25,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-07 16:43:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:25,234 INFO L225 Difference]: With dead ends: 121 [2018-11-07 16:43:25,234 INFO L226 Difference]: Without dead ends: 119 [2018-11-07 16:43:25,235 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-07 16:43:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-07 16:43:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2018-11-07 16:43:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-07 16:43:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 173 transitions. [2018-11-07 16:43:25,278 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 173 transitions. Word has length 16 [2018-11-07 16:43:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:25,278 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 173 transitions. [2018-11-07 16:43:25,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:43:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 173 transitions. [2018-11-07 16:43:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-07 16:43:25,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:25,282 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:25,282 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:25,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash -492506935, now seen corresponding path program 1 times [2018-11-07 16:43:25,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:25,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:25,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:25,284 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:25,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:25,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:25,460 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-07 16:43:25,462 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109] [2018-11-07 16:43:25,498 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:25,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:25,625 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:25,680 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:25,681 INFO L272 AbstractInterpreter]: Visited 20 different actions 25 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-11-07 16:43:25,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:25,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:25,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:25,691 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:25,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:25,702 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:25,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:26,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 16:43:26,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:26,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 16 [2018-11-07 16:43:26,469 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:26,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 16:43:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 16:43:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:43:26,472 INFO L87 Difference]: Start difference. First operand 112 states and 173 transitions. Second operand 12 states. [2018-11-07 16:43:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:28,208 INFO L93 Difference]: Finished difference Result 245 states and 387 transitions. [2018-11-07 16:43:28,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:43:28,209 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-07 16:43:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:28,215 INFO L225 Difference]: With dead ends: 245 [2018-11-07 16:43:28,215 INFO L226 Difference]: Without dead ends: 243 [2018-11-07 16:43:28,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2018-11-07 16:43:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-07 16:43:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 202. [2018-11-07 16:43:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-07 16:43:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 323 transitions. [2018-11-07 16:43:28,271 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 323 transitions. Word has length 21 [2018-11-07 16:43:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:28,272 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 323 transitions. [2018-11-07 16:43:28,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 16:43:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 323 transitions. [2018-11-07 16:43:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 16:43:28,274 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:28,274 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:28,274 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:28,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1278784497, now seen corresponding path program 1 times [2018-11-07 16:43:28,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:28,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:28,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:28,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:28,277 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 16:43:28,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:28,403 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:28,403 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 16:43:28,403 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111] [2018-11-07 16:43:28,405 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:28,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:28,419 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:28,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:28,458 INFO L272 AbstractInterpreter]: Visited 24 different actions 34 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-07 16:43:28,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:28,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:28,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:28,465 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:28,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:28,476 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:28,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:43:28,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:43:28,604 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:43:28,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-11-07 16:43:28,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:28,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:43:28,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:43:28,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:43:28,606 INFO L87 Difference]: Start difference. First operand 202 states and 323 transitions. Second operand 6 states. [2018-11-07 16:43:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:28,965 INFO L93 Difference]: Finished difference Result 274 states and 432 transitions. [2018-11-07 16:43:28,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:43:28,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-07 16:43:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:28,969 INFO L225 Difference]: With dead ends: 274 [2018-11-07 16:43:28,970 INFO L226 Difference]: Without dead ends: 272 [2018-11-07 16:43:28,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-07 16:43:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-11-07 16:43:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 235. [2018-11-07 16:43:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-07 16:43:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 374 transitions. [2018-11-07 16:43:29,021 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 374 transitions. Word has length 28 [2018-11-07 16:43:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:29,022 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 374 transitions. [2018-11-07 16:43:29,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:43:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 374 transitions. [2018-11-07 16:43:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 16:43:29,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:29,025 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:29,025 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:29,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:29,025 INFO L82 PathProgramCache]: Analyzing trace with hash -249410930, now seen corresponding path program 1 times [2018-11-07 16:43:29,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:29,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:29,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:29,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:29,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:43:29,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:29,353 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:29,353 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 16:43:29,354 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105] [2018-11-07 16:43:29,356 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:29,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:29,384 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:29,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:29,438 INFO L272 AbstractInterpreter]: Visited 24 different actions 39 times. Never merged. Never widened. Never found a fixpoint. Largest state had 13 variables. [2018-11-07 16:43:29,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:29,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:29,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:29,451 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:29,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:29,460 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:29,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:43:29,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:29,630 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:43:29,651 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:43:29,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 9 [2018-11-07 16:43:29,651 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:29,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:43:29,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:43:29,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-07 16:43:29,653 INFO L87 Difference]: Start difference. First operand 235 states and 374 transitions. Second operand 6 states. [2018-11-07 16:43:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:30,149 INFO L93 Difference]: Finished difference Result 317 states and 503 transitions. [2018-11-07 16:43:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 16:43:30,150 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-07 16:43:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:30,154 INFO L225 Difference]: With dead ends: 317 [2018-11-07 16:43:30,154 INFO L226 Difference]: Without dead ends: 315 [2018-11-07 16:43:30,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-07 16:43:30,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-07 16:43:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 288. [2018-11-07 16:43:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-11-07 16:43:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 463 transitions. [2018-11-07 16:43:30,210 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 463 transitions. Word has length 31 [2018-11-07 16:43:30,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:30,211 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 463 transitions. [2018-11-07 16:43:30,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:43:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 463 transitions. [2018-11-07 16:43:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 16:43:30,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:30,213 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:30,214 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:30,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:30,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1125815644, now seen corresponding path program 1 times [2018-11-07 16:43:30,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:30,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:30,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:30,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:30,216 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:43:30,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:30,578 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:30,578 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-11-07 16:43:30,578 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113] [2018-11-07 16:43:30,580 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:30,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:30,591 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:30,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:30,623 INFO L272 AbstractInterpreter]: Visited 26 different actions 41 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-07 16:43:30,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:30,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:30,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:30,659 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:30,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:30,671 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:30,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:30,919 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 11 [2018-11-07 16:43:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:43:31,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:43:31,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:31,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2018-11-07 16:43:31,244 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:31,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:43:31,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:43:31,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-07 16:43:31,245 INFO L87 Difference]: Start difference. First operand 288 states and 463 transitions. Second operand 14 states. [2018-11-07 16:43:32,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:32,928 INFO L93 Difference]: Finished difference Result 382 states and 598 transitions. [2018-11-07 16:43:32,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 16:43:32,939 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-11-07 16:43:32,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:32,943 INFO L225 Difference]: With dead ends: 382 [2018-11-07 16:43:32,943 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 16:43:32,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2018-11-07 16:43:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 16:43:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 337. [2018-11-07 16:43:32,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-07 16:43:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 531 transitions. [2018-11-07 16:43:32,989 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 531 transitions. Word has length 33 [2018-11-07 16:43:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:32,990 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 531 transitions. [2018-11-07 16:43:32,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:43:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 531 transitions. [2018-11-07 16:43:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-07 16:43:32,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:32,992 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:32,992 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:32,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:32,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1831965438, now seen corresponding path program 1 times [2018-11-07 16:43:32,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:32,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:32,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:32,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:32,994 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 16:43:33,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:33,103 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:33,103 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-07 16:43:33,103 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [31], [33], [36], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [99], [119], [120], [121], [122] [2018-11-07 16:43:33,105 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:33,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:33,115 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:33,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:33,137 INFO L272 AbstractInterpreter]: Visited 25 different actions 35 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2018-11-07 16:43:33,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:33,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:33,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:33,167 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:33,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:33,176 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:33,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:43:33,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 16:43:33,342 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:43:33,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 11 [2018-11-07 16:43:33,342 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:33,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:43:33,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:43:33,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-07 16:43:33,344 INFO L87 Difference]: Start difference. First operand 337 states and 531 transitions. Second operand 7 states. [2018-11-07 16:43:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:33,616 INFO L93 Difference]: Finished difference Result 351 states and 543 transitions. [2018-11-07 16:43:33,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:43:33,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-11-07 16:43:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:33,624 INFO L225 Difference]: With dead ends: 351 [2018-11-07 16:43:33,625 INFO L226 Difference]: Without dead ends: 349 [2018-11-07 16:43:33,626 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-11-07 16:43:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-07 16:43:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-11-07 16:43:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-11-07 16:43:33,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 537 transitions. [2018-11-07 16:43:33,675 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 537 transitions. Word has length 32 [2018-11-07 16:43:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:33,676 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 537 transitions. [2018-11-07 16:43:33,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:43:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 537 transitions. [2018-11-07 16:43:33,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-07 16:43:33,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:33,678 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:33,678 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:33,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:33,678 INFO L82 PathProgramCache]: Analyzing trace with hash 797412390, now seen corresponding path program 1 times [2018-11-07 16:43:33,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:33,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:33,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:33,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:33,680 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 16:43:33,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:33,825 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:33,825 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-11-07 16:43:33,825 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [13], [17], [23], [27], [33], [49], [53], [58], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113] [2018-11-07 16:43:33,827 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:33,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:33,835 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:33,875 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:33,875 INFO L272 AbstractInterpreter]: Visited 26 different actions 41 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-07 16:43:33,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:33,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:33,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:33,886 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:33,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:33,897 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:33,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:43:34,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-07 16:43:34,288 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:43:34,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [9] total 17 [2018-11-07 16:43:34,288 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:34,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 16:43:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 16:43:34,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-11-07 16:43:34,290 INFO L87 Difference]: Start difference. First operand 345 states and 537 transitions. Second operand 8 states. [2018-11-07 16:43:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:34,796 INFO L93 Difference]: Finished difference Result 564 states and 907 transitions. [2018-11-07 16:43:34,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:43:34,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-07 16:43:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:34,802 INFO L225 Difference]: With dead ends: 564 [2018-11-07 16:43:34,802 INFO L226 Difference]: Without dead ends: 562 [2018-11-07 16:43:34,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2018-11-07 16:43:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-11-07 16:43:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 533. [2018-11-07 16:43:34,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-07 16:43:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 863 transitions. [2018-11-07 16:43:34,887 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 863 transitions. Word has length 33 [2018-11-07 16:43:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:34,888 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 863 transitions. [2018-11-07 16:43:34,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 16:43:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 863 transitions. [2018-11-07 16:43:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 16:43:34,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:34,890 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:34,890 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:34,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:34,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502379, now seen corresponding path program 1 times [2018-11-07 16:43:34,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:34,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:34,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:34,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:34,892 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-07 16:43:35,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:35,130 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:35,130 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-11-07 16:43:35,130 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109] [2018-11-07 16:43:35,132 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:35,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:35,141 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:35,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:35,175 INFO L272 AbstractInterpreter]: Visited 30 different actions 55 times. Never merged. Never widened. Never found a fixpoint. Largest state had 14 variables. [2018-11-07 16:43:35,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:35,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:35,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:35,215 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:35,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:35,233 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:35,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:43:35,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-07 16:43:35,502 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:43:35,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-11-07 16:43:35,502 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:35,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:43:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:43:35,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:43:35,504 INFO L87 Difference]: Start difference. First operand 533 states and 863 transitions. Second operand 7 states. [2018-11-07 16:43:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:36,107 INFO L93 Difference]: Finished difference Result 609 states and 972 transitions. [2018-11-07 16:43:36,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 16:43:36,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-11-07 16:43:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:36,126 INFO L225 Difference]: With dead ends: 609 [2018-11-07 16:43:36,126 INFO L226 Difference]: Without dead ends: 607 [2018-11-07 16:43:36,127 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:43:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-07 16:43:36,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 537. [2018-11-07 16:43:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2018-11-07 16:43:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 866 transitions. [2018-11-07 16:43:36,212 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 866 transitions. Word has length 43 [2018-11-07 16:43:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:36,212 INFO L480 AbstractCegarLoop]: Abstraction has 537 states and 866 transitions. [2018-11-07 16:43:36,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:43:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 866 transitions. [2018-11-07 16:43:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-07 16:43:36,214 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:36,214 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:36,214 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:36,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash 351208904, now seen corresponding path program 1 times [2018-11-07 16:43:36,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:36,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:36,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:36,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:36,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-07 16:43:36,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:36,318 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:36,319 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-07 16:43:36,319 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [31], [33], [49], [53], [58], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [119], [120], [121], [122] [2018-11-07 16:43:36,321 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:36,321 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:36,328 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:36,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:36,355 INFO L272 AbstractInterpreter]: Visited 31 different actions 51 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-07 16:43:36,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:36,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:36,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:36,392 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:36,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:36,409 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:36,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:36,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 16:43:36,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-07 16:43:36,813 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 16:43:36,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [8] total 10 [2018-11-07 16:43:36,814 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:36,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 16:43:36,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 16:43:36,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-11-07 16:43:36,815 INFO L87 Difference]: Start difference. First operand 537 states and 866 transitions. Second operand 7 states. [2018-11-07 16:43:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:37,184 INFO L93 Difference]: Finished difference Result 610 states and 982 transitions. [2018-11-07 16:43:37,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 16:43:37,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-11-07 16:43:37,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:37,191 INFO L225 Difference]: With dead ends: 610 [2018-11-07 16:43:37,192 INFO L226 Difference]: Without dead ends: 608 [2018-11-07 16:43:37,194 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:43:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-11-07 16:43:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 541. [2018-11-07 16:43:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2018-11-07 16:43:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 869 transitions. [2018-11-07 16:43:37,288 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 869 transitions. Word has length 44 [2018-11-07 16:43:37,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:37,288 INFO L480 AbstractCegarLoop]: Abstraction has 541 states and 869 transitions. [2018-11-07 16:43:37,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 16:43:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 869 transitions. [2018-11-07 16:43:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-07 16:43:37,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:37,291 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:37,291 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:37,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:37,292 INFO L82 PathProgramCache]: Analyzing trace with hash 506108398, now seen corresponding path program 1 times [2018-11-07 16:43:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:37,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:37,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:37,293 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 19 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-07 16:43:37,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:37,796 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:37,796 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 65 with the following transitions: [2018-11-07 16:43:37,796 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [49], [53], [58], [63], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118] [2018-11-07 16:43:37,798 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:37,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:37,805 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:37,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:37,886 INFO L272 AbstractInterpreter]: Visited 32 different actions 105 times. Merged at 12 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2018-11-07 16:43:37,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:37,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:37,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:37,925 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:37,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:37,941 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:37,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-11-07 16:43:38,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-07 16:43:38,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-07 16:43:38,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2018-11-07 16:43:38,468 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 16:43:38,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 16:43:38,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 16:43:38,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-07 16:43:38,470 INFO L87 Difference]: Start difference. First operand 541 states and 869 transitions. Second operand 6 states. [2018-11-07 16:43:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:38,940 INFO L93 Difference]: Finished difference Result 1026 states and 1618 transitions. [2018-11-07 16:43:38,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 16:43:38,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-07 16:43:38,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:38,946 INFO L225 Difference]: With dead ends: 1026 [2018-11-07 16:43:38,946 INFO L226 Difference]: Without dead ends: 550 [2018-11-07 16:43:38,951 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-07 16:43:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-11-07 16:43:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 490. [2018-11-07 16:43:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-11-07 16:43:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 770 transitions. [2018-11-07 16:43:39,048 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 770 transitions. Word has length 64 [2018-11-07 16:43:39,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:39,048 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 770 transitions. [2018-11-07 16:43:39,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 16:43:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 770 transitions. [2018-11-07 16:43:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-07 16:43:39,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:39,052 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:39,052 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:39,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:39,053 INFO L82 PathProgramCache]: Analyzing trace with hash -541127611, now seen corresponding path program 1 times [2018-11-07 16:43:39,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:39,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:39,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 27 proven. 51 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-07 16:43:39,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:39,773 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:39,773 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2018-11-07 16:43:39,773 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [31], [33], [49], [53], [58], [63], [69], [72], [84], [87], [89], [92], [94], [95], [96], [97], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118], [119], [120], [121], [122] [2018-11-07 16:43:39,776 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:39,777 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:39,785 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:39,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:39,912 INFO L272 AbstractInterpreter]: Visited 39 different actions 139 times. Merged at 16 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 15 variables. [2018-11-07 16:43:39,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:39,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:39,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:39,940 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:39,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:39,959 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:39,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 90 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-11-07 16:43:41,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-07 16:43:43,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:43,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2018-11-07 16:43:43,532 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:43,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-07 16:43:43,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-07 16:43:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=325, Unknown=1, NotChecked=0, Total=380 [2018-11-07 16:43:43,536 INFO L87 Difference]: Start difference. First operand 490 states and 770 transitions. Second operand 14 states. [2018-11-07 16:43:52,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:43:52,921 INFO L93 Difference]: Finished difference Result 1500 states and 2421 transitions. [2018-11-07 16:43:52,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-07 16:43:52,927 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 80 [2018-11-07 16:43:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:43:52,930 INFO L225 Difference]: With dead ends: 1500 [2018-11-07 16:43:52,931 INFO L226 Difference]: Without dead ends: 387 [2018-11-07 16:43:52,937 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=473, Invalid=1976, Unknown=1, NotChecked=0, Total=2450 [2018-11-07 16:43:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-11-07 16:43:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 251. [2018-11-07 16:43:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-07 16:43:52,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 365 transitions. [2018-11-07 16:43:52,986 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 365 transitions. Word has length 80 [2018-11-07 16:43:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:43:52,986 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 365 transitions. [2018-11-07 16:43:52,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-07 16:43:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 365 transitions. [2018-11-07 16:43:52,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-07 16:43:52,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:43:52,988 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:43:52,988 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:43:52,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:52,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1543835351, now seen corresponding path program 1 times [2018-11-07 16:43:52,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:43:52,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:52,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:52,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:43:52,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:43:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 25 proven. 46 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-11-07 16:43:53,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:53,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:43:53,531 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 92 with the following transitions: [2018-11-07 16:43:53,531 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [49], [53], [58], [63], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118] [2018-11-07 16:43:53,533 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:43:53,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:43:53,538 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:43:53,660 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:43:53,660 INFO L272 AbstractInterpreter]: Visited 43 different actions 291 times. Merged at 19 different actions 45 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 15 variables. [2018-11-07 16:43:53,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:43:53,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:43:53,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:43:53,688 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:43:53,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:43:53,702 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:43:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:43:53,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:43:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 28 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:43:54,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:43:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-11-07 16:43:55,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:43:55,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2018-11-07 16:43:55,162 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:43:55,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:43:55,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:43:55,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:43:55,163 INFO L87 Difference]: Start difference. First operand 251 states and 365 transitions. Second operand 16 states. [2018-11-07 16:44:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:02,696 INFO L93 Difference]: Finished difference Result 378 states and 546 transitions. [2018-11-07 16:44:02,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 16:44:02,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 91 [2018-11-07 16:44:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:02,699 INFO L225 Difference]: With dead ends: 378 [2018-11-07 16:44:02,699 INFO L226 Difference]: Without dead ends: 130 [2018-11-07 16:44:02,702 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=636, Invalid=2226, Unknown=0, NotChecked=0, Total=2862 [2018-11-07 16:44:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-07 16:44:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-11-07 16:44:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-07 16:44:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 164 transitions. [2018-11-07 16:44:02,724 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 164 transitions. Word has length 91 [2018-11-07 16:44:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:02,724 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 164 transitions. [2018-11-07 16:44:02,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:44:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 164 transitions. [2018-11-07 16:44:02,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-07 16:44:02,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 16:44:02,726 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 16:44:02,727 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 16:44:02,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:02,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1427230411, now seen corresponding path program 1 times [2018-11-07 16:44:02,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 16:44:02,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:02,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:02,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 16:44:02,728 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 16:44:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 33 proven. 64 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-11-07 16:44:03,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:03,531 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 16:44:03,531 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 114 with the following transitions: [2018-11-07 16:44:03,532 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [17], [23], [27], [33], [36], [41], [44], [53], [58], [63], [84], [87], [89], [92], [94], [95], [96], [97], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118] [2018-11-07 16:44:03,533 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 16:44:03,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 16:44:03,539 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 16:44:03,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 16:44:03,617 INFO L272 AbstractInterpreter]: Visited 42 different actions 165 times. Merged at 18 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2018-11-07 16:44:03,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 16:44:03,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 16:44:03,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 16:44:03,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 16:44:03,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 16:44:03,677 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 16:44:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 16:44:03,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 16:44:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:44:04,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 16:44:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 593 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2018-11-07 16:44:05,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 16:44:05,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2018-11-07 16:44:05,531 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 16:44:05,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-07 16:44:05,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-07 16:44:05,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-11-07 16:44:05,532 INFO L87 Difference]: Start difference. First operand 129 states and 164 transitions. Second operand 16 states. [2018-11-07 16:44:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 16:44:08,325 INFO L93 Difference]: Finished difference Result 133 states and 168 transitions. [2018-11-07 16:44:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 16:44:08,326 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 113 [2018-11-07 16:44:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 16:44:08,327 INFO L225 Difference]: With dead ends: 133 [2018-11-07 16:44:08,327 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 16:44:08,329 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 16:44:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 16:44:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 16:44:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 16:44:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 16:44:08,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-11-07 16:44:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 16:44:08,330 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 16:44:08,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-07 16:44:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 16:44:08,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 16:44:08,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 16:44:08,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,732 WARN L179 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 151 [2018-11-07 16:44:08,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:08,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,127 WARN L179 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 153 [2018-11-07 16:44:09,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,494 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 106 [2018-11-07 16:44:09,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,671 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 109 [2018-11-07 16:44:09,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,830 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 143 [2018-11-07 16:44:09,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 16:44:09,991 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 126 [2018-11-07 16:44:10,823 WARN L179 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 20 [2018-11-07 16:44:11,887 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 150 DAG size of output: 34 [2018-11-07 16:44:12,542 WARN L179 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 20 [2018-11-07 16:44:15,217 WARN L179 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 151 DAG size of output: 33 [2018-11-07 16:44:15,401 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 19 [2018-11-07 16:44:15,645 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 19 [2018-11-07 16:44:15,819 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 20 [2018-11-07 16:44:15,974 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 19 [2018-11-07 16:44:16,152 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 20 [2018-11-07 16:44:16,373 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 18 [2018-11-07 16:44:16,520 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 19 [2018-11-07 16:44:17,203 WARN L179 SmtUtils]: Spent 681.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 39 [2018-11-07 16:44:17,606 WARN L179 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 18 [2018-11-07 16:44:19,246 WARN L179 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 116 DAG size of output: 48 [2018-11-07 16:44:25,639 WARN L179 SmtUtils]: Spent 6.33 s on a formula simplification. DAG size of input: 111 DAG size of output: 28 [2018-11-07 16:44:25,643 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 16:44:25,643 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:44:25,643 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 16:44:25,643 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 16:44:25,643 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 16:44:25,643 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 16:44:25,644 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-07 16:44:25,644 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2018-11-07 16:44:25,644 INFO L421 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse5 (div main_~n~0 2))) (let ((.cse2 (<= 1 main_~i~0)) (.cse3 (<= main_~l~0 (+ .cse5 1))) (.cse0 (<= main_~r~0 main_~n~0)) (.cse1 (<= main_~j~0 main_~n~0)) (.cse4 (<= 2 main_~r~0))) (or (and (<= main_~i~0 main_~n~0) .cse0 .cse1 (and .cse2 (and (<= 2 main_~j~0) (<= 1 main_~l~0) .cse3 (<= (+ main_~l~0 1) main_~n~0) .cse4))) (and (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) (or (and (<= main_~r~0 main_~j~0) .cse2 (and (and .cse1 .cse4) (<= main_~l~0 .cse5)) (exists ((v_main_~l~0_34 Int)) (and (< 1 v_main_~l~0_34) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_34)) (<= v_main_~l~0_34 (+ main_~l~0 1))))) (and .cse2 .cse3 .cse0 .cse1 (<= main_~j~0 (* 2 main_~l~0)) (exists ((v_main_~l~0_34 Int) (main_~l~0 Int)) (and (< 1 v_main_~l~0_34) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_34)) (<= v_main_~l~0_34 (+ main_~l~0 1)) (<= (* 2 main_~l~0) main_~j~0))) .cse4)))))) [2018-11-07 16:44:25,644 INFO L421 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-07 16:44:25,644 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 24 44) no Hoare annotation was computed. [2018-11-07 16:44:25,644 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 44) the Hoare annotation is: (let ((.cse0 (<= 1 main_~l~0)) (.cse1 (<= 1 main_~i~0)) (.cse2 (<= main_~l~0 (+ (div main_~n~0 2) 1))) (.cse3 (<= 2 main_~r~0))) (or (and (<= 2 main_~j~0) .cse0 .cse1 (<= main_~i~0 main_~n~0) .cse2 (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) .cse3) (and .cse0 .cse1 .cse2 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse3 (<= (+ main_~r~0 1) main_~n~0)))) [2018-11-07 16:44:25,645 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 21 54) no Hoare annotation was computed. [2018-11-07 16:44:25,645 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2018-11-07 16:44:25,645 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2018-11-07 16:44:25,645 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-11-07 16:44:25,645 INFO L421 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-07 16:44:25,645 INFO L425 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-11-07 16:44:25,645 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2018-11-07 16:44:25,645 INFO L421 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-07 16:44:25,645 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 54) no Hoare annotation was computed. [2018-11-07 16:44:25,645 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 21 54) no Hoare annotation was computed. [2018-11-07 16:44:25,645 INFO L421 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-07 16:44:25,646 INFO L421 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-07 16:44:25,646 INFO L421 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse4 (<= 2 main_~l~0)) (.cse2 (<= 2 main_~j~0)) (.cse3 (and (<= 1 main_~l~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= 2 main_~r~0)))) (let ((.cse0 (and .cse4 (and .cse2 .cse3))) (.cse1 (<= main_~r~0 main_~n~0))) (or (and .cse0 (<= main_~i~0 main_~n~0) .cse1) (and .cse0 .cse1 (<= main_~j~0 (* 2 main_~l~0))) (and .cse2 .cse3 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) .cse4 (<= (+ main_~r~0 1) main_~n~0)) (and .cse0 .cse1 (<= main_~j~0 main_~n~0))))) [2018-11-07 16:44:25,646 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-07 16:44:25,646 INFO L421 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse2 (<= 2 main_~j~0)) (.cse3 (and (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= 2 main_~r~0))) (.cse4 (<= 2 main_~l~0))) (let ((.cse1 (and (and .cse2 .cse3) .cse4)) (.cse0 (<= main_~r~0 main_~n~0))) (or (and (<= main_~i~0 main_~n~0) .cse0 .cse1) (and (and .cse2 .cse3 (exists ((main_~l~0 Int)) (and (<= main_~i~0 main_~l~0) (<= (* 2 main_~l~0) main_~j~0))) (<= (+ main_~r~0 1) main_~n~0)) .cse4) (and .cse0 (<= main_~j~0 main_~n~0) .cse1) (and (and .cse1 (<= main_~j~0 (* 2 main_~l~0))) .cse0)))) [2018-11-07 16:44:25,646 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2018-11-07 16:44:25,646 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-07 16:44:25,646 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~l~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-07 16:44:25,646 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 16:44:25,646 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-07 16:44:25,646 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2018-11-07 16:44:25,646 INFO L421 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-07 16:44:25,647 INFO L421 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= main_~i~0 main_~n~0) (<= main_~l~0 (+ (div main_~n~0 2) 1)) (<= (+ main_~j~0 1) main_~n~0) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2018-11-07 16:44:25,647 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-07 16:44:25,647 INFO L425 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-11-07 16:44:25,647 INFO L421 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (<= main_~j~0 main_~n~0)) (.cse1 (<= 1 main_~i~0)) (.cse2 (div main_~n~0 2)) (.cse3 (<= 2 main_~r~0))) (or (and (<= main_~i~0 main_~n~0) (<= main_~r~0 main_~n~0) .cse0 (and .cse1 (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 (+ .cse2 1)) (<= (+ main_~l~0 1) main_~n~0) .cse3))) (and (<= main_~r~0 main_~j~0) (exists ((v_main_~l~0_34 Int)) (and (< 1 v_main_~l~0_34) (<= (+ main_~r~0 1) (* 2 v_main_~l~0_34)) (<= v_main_~l~0_34 (+ main_~l~0 1)))) (exists ((main_~l~0 Int)) (and (<= 1 main_~l~0) (<= (+ (* 2 main_~l~0) 1) main_~j~0))) .cse0 .cse1 (<= main_~l~0 .cse2) .cse3))) [2018-11-07 16:44:25,647 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-07 16:44:25,647 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 16:44:25,647 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 16:44:25,647 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 16:44:25,647 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 16:44:25,648 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 16:44:25,648 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 16:44:25,652 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-07 16:44:25,653 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-07 16:44:25,661 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-07 16:44:25,661 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-07 16:44:25,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:44:25 BoogieIcfgContainer [2018-11-07 16:44:25,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 16:44:25,665 INFO L168 Benchmark]: Toolchain (without parser) took 63641.45 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -709.9 MB). Peak memory consumption was 852.9 MB. Max. memory is 7.1 GB. [2018-11-07 16:44:25,666 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:44:25,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:44:25,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:44:25,667 INFO L168 Benchmark]: Boogie Preprocessor took 50.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 16:44:25,668 INFO L168 Benchmark]: RCFGBuilder took 700.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 16:44:25,668 INFO L168 Benchmark]: TraceAbstraction took 62559.17 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 368.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 66.9 MB). Peak memory consumption was 889.6 MB. Max. memory is 7.1 GB. [2018-11-07 16:44:25,673 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.88 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 700.96 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62559.17 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 368.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 66.9 MB). Peak memory consumption was 889.6 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_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~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: 24]: Loop Invariant [2018-11-07 16:44:25,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-07 16:44:25,680 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-07 16:44:25,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] [2018-11-07 16:44:25,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~l~0,QUANTIFIED] Derived loop invariant: (((((((2 <= j && 1 <= l) && 1 <= i) && i <= n) && l <= n / 2 + 1) && l + 1 <= n) && r <= n) && 2 <= r) || (((((1 <= l && 1 <= i) && l <= n / 2 + 1) && (\exists main_~l~0 : int :: i <= main_~l~0 && 2 * main_~l~0 <= j)) && 2 <= r) && r + 1 <= n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. SAFE Result, 62.4s OverallTime, 15 OverallIterations, 18 TraceHistogramMax, 27.7s AutomataDifference, 0.0s DeadEndRemovalTime, 17.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 987 SDtfs, 976 SDslu, 4206 SDs, 0 SdLazy, 5840 SolverSat, 1816 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 22.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1492 GetRequests, 1191 SyntacticMatches, 26 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=541occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.3s AbstIntTime, 12 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 535 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 972 PreInvPairs, 1452 NumberOfFragments, 844 HoareAnnotationTreeSize, 972 FomulaSimplifications, 31143393 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 20 FomulaSimplificationsInter, 2425921 FormulaSimplificationTreeSizeReductionInter, 15.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 1273 NumberOfCodeBlocks, 1273 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1847 ConstructedInterpolants, 139 QuantifiedInterpolants, 416449 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1392 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 39 InterpolantComputations, 16 PerfectInterpolantSequences, 4044/4356 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...