java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b6335f6 [2018-10-23 10:00:23,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-23 10:00:23,258 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-23 10:00:23,270 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-23 10:00:23,270 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-23 10:00:23,271 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-23 10:00:23,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-23 10:00:23,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-23 10:00:23,276 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-23 10:00:23,277 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-23 10:00:23,278 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-23 10:00:23,278 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-23 10:00:23,279 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-23 10:00:23,280 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-23 10:00:23,281 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-23 10:00:23,282 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-23 10:00:23,283 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-23 10:00:23,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-23 10:00:23,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-23 10:00:23,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-23 10:00:23,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-23 10:00:23,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-23 10:00:23,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-23 10:00:23,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-23 10:00:23,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-23 10:00:23,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-23 10:00:23,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-23 10:00:23,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-23 10:00:23,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-23 10:00:23,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-23 10:00:23,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-23 10:00:23,305 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-23 10:00:23,305 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-23 10:00:23,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-23 10:00:23,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-23 10:00:23,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-23 10:00:23,308 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-10-23 10:00:23,331 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-23 10:00:23,331 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-23 10:00:23,332 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-23 10:00:23,332 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-23 10:00:23,333 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-23 10:00:23,334 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-23 10:00:23,334 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-23 10:00:23,334 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-23 10:00:23,334 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-23 10:00:23,334 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-23 10:00:23,335 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-23 10:00:23,335 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-23 10:00:23,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-23 10:00:23,337 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-23 10:00:23,337 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-23 10:00:23,337 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-23 10:00:23,337 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-23 10:00:23,337 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-23 10:00:23,338 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-23 10:00:23,338 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-23 10:00:23,338 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-23 10:00:23,338 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-23 10:00:23,338 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-23 10:00:23,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-23 10:00:23,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-23 10:00:23,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-23 10:00:23,340 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-23 10:00:23,341 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-23 10:00:23,341 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-23 10:00:23,341 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-23 10:00:23,341 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-23 10:00:23,341 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-23 10:00:23,341 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-23 10:00:23,342 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-23 10:00:23,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-23 10:00:23,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-23 10:00:23,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-23 10:00:23,410 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-23 10:00:23,411 INFO L276 PluginConnector]: CDTParser initialized [2018-10-23 10:00:23,411 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-10-23 10:00:23,479 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d3f9a9e4f/9e53a979ba4b43d693041ab18a393192/FLAGa94695036 [2018-10-23 10:00:23,992 INFO L298 CDTParser]: Found 1 translation units. [2018-10-23 10:00:23,993 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call2_true-termination.i [2018-10-23 10:00:24,000 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d3f9a9e4f/9e53a979ba4b43d693041ab18a393192/FLAGa94695036 [2018-10-23 10:00:24,015 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d3f9a9e4f/9e53a979ba4b43d693041ab18a393192 [2018-10-23 10:00:24,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-23 10:00:24,027 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-23 10:00:24,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-23 10:00:24,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-23 10:00:24,031 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-23 10:00:24,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3354c03c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24, skipping insertion in model container [2018-10-23 10:00:24,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-23 10:00:24,064 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-23 10:00:24,255 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 10:00:24,259 INFO L189 MainTranslator]: Completed pre-run [2018-10-23 10:00:24,282 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-23 10:00:24,306 INFO L193 MainTranslator]: Completed translation [2018-10-23 10:00:24,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24 WrapperNode [2018-10-23 10:00:24,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-23 10:00:24,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-23 10:00:24,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-23 10:00:24,308 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-23 10:00:24,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-23 10:00:24,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-23 10:00:24,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-23 10:00:24,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-23 10:00:24,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (1/1) ... [2018-10-23 10:00:24,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-23 10:00:24,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-23 10:00:24,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-23 10:00:24,376 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-23 10:00:24,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:00:24,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-23 10:00:24,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-23 10:00:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-23 10:00:24,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-23 10:00:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-23 10:00:24,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-23 10:00:24,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-23 10:00:24,504 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-23 10:00:24,840 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-23 10:00:24,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:00:24 BoogieIcfgContainer [2018-10-23 10:00:24,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-23 10:00:24,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-23 10:00:24,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-23 10:00:24,845 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-23 10:00:24,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:00:24" (1/3) ... [2018-10-23 10:00:24,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c97ca75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:00:24, skipping insertion in model container [2018-10-23 10:00:24,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:00:24" (2/3) ... [2018-10-23 10:00:24,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c97ca75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:00:24, skipping insertion in model container [2018-10-23 10:00:24,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:00:24" (3/3) ... [2018-10-23 10:00:24,849 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call2_true-termination.i [2018-10-23 10:00:24,857 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-23 10:00:24,865 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-23 10:00:24,882 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-23 10:00:24,912 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-23 10:00:24,912 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-23 10:00:24,912 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-23 10:00:24,912 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-23 10:00:24,912 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-23 10:00:24,913 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-23 10:00:24,913 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-23 10:00:24,913 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-23 10:00:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-10-23 10:00:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-23 10:00:24,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:24,938 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:24,940 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:24,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:24,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1193744236, now seen corresponding path program 1 times [2018-10-23 10:00:24,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:24,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:24,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:24,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:24,995 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:25,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:00:25,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-23 10:00:25,073 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:00:25,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-23 10:00:25,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-23 10:00:25,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-23 10:00:25,094 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-10-23 10:00:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:00:25,117 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-10-23 10:00:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-23 10:00:25,118 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-23 10:00:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:00:25,126 INFO L225 Difference]: With dead ends: 43 [2018-10-23 10:00:25,126 INFO L226 Difference]: Without dead ends: 21 [2018-10-23 10:00:25,130 INFO L605 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-10-23 10:00:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-23 10:00:25,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-23 10:00:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-23 10:00:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-10-23 10:00:25,173 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 14 [2018-10-23 10:00:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:00:25,173 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-10-23 10:00:25,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-23 10:00:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-10-23 10:00:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-23 10:00:25,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:25,175 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:25,175 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:25,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1255135895, now seen corresponding path program 1 times [2018-10-23 10:00:25,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:25,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:25,179 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:25,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-23 10:00:25,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-23 10:00:25,308 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-23 10:00:25,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-23 10:00:25,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-23 10:00:25,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 10:00:25,311 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 3 states. [2018-10-23 10:00:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:00:25,454 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-10-23 10:00:25,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-23 10:00:25,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-23 10:00:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:00:25,459 INFO L225 Difference]: With dead ends: 41 [2018-10-23 10:00:25,459 INFO L226 Difference]: Without dead ends: 29 [2018-10-23 10:00:25,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-23 10:00:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-23 10:00:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-10-23 10:00:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-23 10:00:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-23 10:00:25,471 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2018-10-23 10:00:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:00:25,472 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-23 10:00:25,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-23 10:00:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-23 10:00:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-23 10:00:25,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:25,474 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:25,475 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:25,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:25,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1812131568, now seen corresponding path program 1 times [2018-10-23 10:00:25,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:25,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:25,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:25,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:25,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:25,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:25,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:25,664 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:00:25,665 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-10-23 10:00:25,668 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [29], [39], [42], [44], [50], [51], [52], [54] [2018-10-23 10:00:25,722 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-23 10:00:25,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-23 10:00:25,890 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-23 10:00:27,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-23 10:00:27,097 INFO L272 AbstractInterpreter]: Visited 17 different actions 165 times. Merged at 4 different actions 118 times. Widened at 1 different actions 26 times. Found 29 fixpoints after 2 different actions. Largest state had 31 variables. [2018-10-23 10:00:27,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:27,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-23 10:00:27,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:27,159 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:00:27,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:27,175 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-23 10:00:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:27,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:00:27,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-23 10:00:27,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-23 10:00:27,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:00:27,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:00:27,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:00:27,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-10-23 10:00:27,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-23 10:00:27,665 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 10:00:27,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-23 10:00:27,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:00:27,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:00:27,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:00:27,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:9 [2018-10-23 10:00:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:27,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:00:28,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-10-23 10:00:28,224 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-23 10:00:28,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-23 10:00:28,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:00:28,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:00:28,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:00:28,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:15 [2018-10-23 10:00:29,385 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 12 [2018-10-23 10:00:29,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:29,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:00:29,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 14 [2018-10-23 10:00:29,416 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:00:29,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-23 10:00:29,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-23 10:00:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-10-23 10:00:29,418 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-10-23 10:00:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:00:30,039 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-10-23 10:00:30,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-23 10:00:30,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-10-23 10:00:30,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:00:30,041 INFO L225 Difference]: With dead ends: 53 [2018-10-23 10:00:30,041 INFO L226 Difference]: Without dead ends: 41 [2018-10-23 10:00:30,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-10-23 10:00:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-23 10:00:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2018-10-23 10:00:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-23 10:00:30,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-10-23 10:00:30,050 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 18 [2018-10-23 10:00:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:00:30,051 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-10-23 10:00:30,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-23 10:00:30,051 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-10-23 10:00:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-23 10:00:30,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:30,052 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:30,053 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:30,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:30,053 INFO L82 PathProgramCache]: Analyzing trace with hash 602547482, now seen corresponding path program 1 times [2018-10-23 10:00:30,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:30,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:30,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:30,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:30,055 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-23 10:00:30,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:30,338 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:00:30,339 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-10-23 10:00:30,340 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [29], [31], [33], [39], [42], [44], [47], [49], [50], [51], [52], [54], [55] [2018-10-23 10:00:30,343 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-23 10:00:30,343 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-23 10:00:30,365 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-23 10:00:31,854 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-23 10:00:31,854 INFO L272 AbstractInterpreter]: Visited 22 different actions 500 times. Merged at 9 different actions 268 times. Widened at 2 different actions 52 times. Found 30 fixpoints after 3 different actions. Largest state had 32 variables. [2018-10-23 10:00:31,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:31,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-23 10:00:31,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:31,890 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:00:31,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:31,905 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-23 10:00:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:31,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:00:32,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-23 10:00:32,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-23 10:00:32,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:00:32,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:00:32,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:00:32,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-10-23 10:00:32,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-10-23 10:00:32,953 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 10:00:32,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-23 10:00:32,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:00:32,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:00:32,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:00:32,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-10-23 10:00:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:35,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:00:38,246 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-23 10:00:40,917 WARN L179 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2018-10-23 10:00:41,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-10-23 10:00:41,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-10-23 10:00:41,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:00:41,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:00:41,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:00:41,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:15 [2018-10-23 10:00:41,732 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-23 10:00:42,559 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-23 10:00:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:00:42,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:00:42,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 25 [2018-10-23 10:00:42,593 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:00:42,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-23 10:00:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-23 10:00:42,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=514, Unknown=3, NotChecked=0, Total=600 [2018-10-23 10:00:42,597 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 14 states. [2018-10-23 10:00:47,415 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 37 [2018-10-23 10:00:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:00:51,921 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2018-10-23 10:00:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-23 10:00:51,922 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-10-23 10:00:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:00:51,924 INFO L225 Difference]: With dead ends: 78 [2018-10-23 10:00:51,924 INFO L226 Difference]: Without dead ends: 59 [2018-10-23 10:00:51,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=130, Invalid=737, Unknown=3, NotChecked=0, Total=870 [2018-10-23 10:00:51,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-23 10:00:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-10-23 10:00:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-23 10:00:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-10-23 10:00:51,939 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 30 [2018-10-23 10:00:51,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:00:51,939 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-10-23 10:00:51,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-23 10:00:51,939 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-10-23 10:00:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-23 10:00:51,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:00:51,941 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:00:51,941 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:00:51,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:00:51,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1500033328, now seen corresponding path program 2 times [2018-10-23 10:00:51,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:00:51,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:51,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:00:51,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:00:51,943 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:00:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:00:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-23 10:00:52,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:52,355 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:00:52,355 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-23 10:00:52,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-23 10:00:52,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:00:52,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:00:52,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 10:00:52,363 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-23 10:00:52,419 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 10:00:52,419 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 10:00:52,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:00:52,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-23 10:00:52,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-23 10:00:52,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:00:52,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:00:52,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:00:52,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-10-23 10:00:56,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-10-23 10:00:56,523 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 10:00:56,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-23 10:00:56,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:00:56,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:00:56,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:00:56,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:34 [2018-10-23 10:00:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-23 10:00:56,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:01:03,219 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-23 10:01:06,011 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2018-10-23 10:01:06,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-10-23 10:01:06,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-10-23 10:01:06,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:01:06,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:01:06,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:01:06,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2018-10-23 10:01:07,939 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 12 [2018-10-23 10:01:09,486 WARN L179 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 14 [2018-10-23 10:01:09,962 WARN L179 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-23 10:01:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-23 10:01:10,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:01:10,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 15] total 30 [2018-10-23 10:01:10,000 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:01:10,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-23 10:01:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-23 10:01:10,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=763, Unknown=3, NotChecked=0, Total=870 [2018-10-23 10:01:10,002 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 17 states. [2018-10-23 10:01:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:01:21,548 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-10-23 10:01:21,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-23 10:01:21,549 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-10-23 10:01:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:01:21,550 INFO L225 Difference]: With dead ends: 89 [2018-10-23 10:01:21,551 INFO L226 Difference]: Without dead ends: 61 [2018-10-23 10:01:21,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=110, Invalid=817, Unknown=3, NotChecked=0, Total=930 [2018-10-23 10:01:21,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-23 10:01:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2018-10-23 10:01:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-23 10:01:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-10-23 10:01:21,564 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2018-10-23 10:01:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:01:21,564 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-10-23 10:01:21,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-23 10:01:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-10-23 10:01:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-23 10:01:21,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:01:21,566 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:01:21,566 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:01:21,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:01:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash -207301449, now seen corresponding path program 3 times [2018-10-23 10:01:21,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:01:21,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:21,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 10:01:21,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:01:21,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:01:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:01:23,746 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 16 [2018-10-23 10:01:27,965 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 23 refuted. 3 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-23 10:01:27,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:01:27,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:01:27,966 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-23 10:01:27,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-23 10:01:27,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:01:27,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:01:27,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 10:01:27,974 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-23 10:01:28,029 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 10:01:28,029 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 10:01:28,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:01:28,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-23 10:01:28,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-23 10:01:28,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:01:28,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:01:28,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:01:28,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-23 10:01:28,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-23 10:01:28,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-10-23 10:01:28,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-23 10:01:28,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:01:28,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-23 10:01:28,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:59 [2018-10-23 10:01:29,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-10-23 10:01:29,441 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 10:01:29,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 44 [2018-10-23 10:01:29,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-23 10:01:29,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-23 10:01:29,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-23 10:01:29,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:75, output treesize:72 [2018-10-23 10:01:31,063 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:01:31,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:01:31,666 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-23 10:01:44,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-23 10:01:44,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-23 10:01:44,284 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 10:01:44,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-23 10:01:44,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-23 10:01:44,310 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-23 10:01:44,310 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-23 10:01:44,321 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:01:44,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:01:44,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-23 10:01:44,346 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:48, output treesize:20 [2018-10-23 10:01:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-23 10:01:44,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:01:44,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 16] total 34 [2018-10-23 10:01:44,670 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:01:44,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-23 10:01:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-23 10:01:44,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=987, Unknown=8, NotChecked=0, Total=1122 [2018-10-23 10:01:44,672 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 20 states. [2018-10-23 10:02:06,936 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 46 [2018-10-23 10:02:07,926 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-23 10:02:15,267 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 46 [2018-10-23 10:02:19,856 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2018-10-23 10:02:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:02:29,848 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-10-23 10:02:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-23 10:02:29,849 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-10-23 10:02:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:02:29,851 INFO L225 Difference]: With dead ends: 107 [2018-10-23 10:02:29,851 INFO L226 Difference]: Without dead ends: 79 [2018-10-23 10:02:29,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=278, Invalid=1968, Unknown=10, NotChecked=0, Total=2256 [2018-10-23 10:02:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-23 10:02:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-10-23 10:02:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-23 10:02:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-23 10:02:29,871 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 45 [2018-10-23 10:02:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:02:29,871 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-23 10:02:29,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-23 10:02:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-23 10:02:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-23 10:02:29,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:02:29,873 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:02:29,873 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:02:29,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:02:29,874 INFO L82 PathProgramCache]: Analyzing trace with hash -597350463, now seen corresponding path program 4 times [2018-10-23 10:02:29,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:02:29,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:02:29,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 10:02:29,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:02:29,875 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:02:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:02:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-23 10:02:32,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:02:32,950 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:02:32,950 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-23 10:02:32,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-23 10:02:32,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:02:32,951 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:02:32,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:02:32,958 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-23 10:02:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:02:33,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:02:33,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-23 10:02:33,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-23 10:02:33,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:02:33,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:02:33,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:02:33,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-23 10:02:33,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-23 10:02:33,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-10-23 10:02:33,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-23 10:02:33,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:02:33,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-23 10:02:33,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:59 [2018-10-23 10:02:35,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-10-23 10:02:35,773 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 10:02:35,823 INFO L303 Elim1Store]: Index analysis took 123 ms [2018-10-23 10:02:35,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 44 [2018-10-23 10:02:35,882 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-23 10:02:35,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-23 10:02:36,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-23 10:02:36,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:75, output treesize:72 [2018-10-23 10:02:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 5 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-23 10:02:36,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:02:36,930 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-23 10:02:50,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-10-23 10:02:50,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-23 10:02:50,031 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 10:02:50,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-10-23 10:02:50,035 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-23 10:02:50,037 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-23 10:02:50,037 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-23 10:02:50,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:02:50,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:02:50,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-23 10:02:50,069 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:48, output treesize:20 [2018-10-23 10:02:50,627 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-23 10:02:50,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:02:50,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 18] total 40 [2018-10-23 10:02:50,649 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:02:50,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-23 10:02:50,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-23 10:02:50,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1391, Unknown=7, NotChecked=0, Total=1560 [2018-10-23 10:02:50,651 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 24 states. [2018-10-23 10:03:03,407 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 46 [2018-10-23 10:03:20,181 WARN L179 SmtUtils]: Spent 4.63 s on a formula simplification that was a NOOP. DAG size: 57 [2018-10-23 10:03:24,758 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-23 10:03:27,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:03:27,208 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2018-10-23 10:03:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-23 10:03:27,209 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-10-23 10:03:27,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:03:27,210 INFO L225 Difference]: With dead ends: 111 [2018-10-23 10:03:27,210 INFO L226 Difference]: Without dead ends: 74 [2018-10-23 10:03:27,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 80 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=277, Invalid=2165, Unknown=8, NotChecked=0, Total=2450 [2018-10-23 10:03:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-23 10:03:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-10-23 10:03:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-23 10:03:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-10-23 10:03:27,226 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 57 [2018-10-23 10:03:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:03:27,226 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-10-23 10:03:27,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-23 10:03:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-10-23 10:03:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-23 10:03:27,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:03:27,228 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:03:27,228 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:03:27,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:03:27,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1336655223, now seen corresponding path program 5 times [2018-10-23 10:03:27,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:03:27,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:03:27,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-23 10:03:27,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:03:27,230 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:03:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:03:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 57 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-23 10:03:31,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:03:31,374 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:03:31,374 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-23 10:03:31,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-23 10:03:31,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:03:31,375 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:03:31,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-23 10:03:31,383 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-10-23 10:03:31,429 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-23 10:03:31,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 10:03:31,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:03:31,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-23 10:03:31,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-23 10:03:31,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:03:31,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:03:31,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:03:31,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2018-10-23 10:03:32,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-23 10:03:32,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-10-23 10:03:32,022 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-23 10:03:32,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:03:32,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-23 10:03:32,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:61 [2018-10-23 10:03:34,418 WARN L179 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 43 [2018-10-23 10:03:36,919 WARN L179 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 74 DAG size of output: 43 [2018-10-23 10:03:37,646 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-10-23 10:03:40,219 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 74 [2018-10-23 10:03:42,352 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 73 [2018-10-23 10:03:42,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-10-23 10:03:42,398 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 10:03:42,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 72 [2018-10-23 10:03:42,414 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-23 10:03:42,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2018-10-23 10:03:42,530 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-23 10:03:42,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2018-10-23 10:03:42,584 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-23 10:03:42,734 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 10:03:42,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 128 [2018-10-23 10:03:42,810 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-23 10:03:42,832 INFO L267 ElimStorePlain]: Start of recursive call 6: 34 dim-0 vars, End of recursive call: 34 dim-0 vars, and 64 xjuncts. [2018-10-23 10:03:47,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 38 dim-0 vars, and 27 xjuncts. [2018-10-23 10:03:48,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-10-23 10:03:48,922 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 11 variables, input treesize:137, output treesize:165 [2018-10-23 10:03:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 7 proven. 120 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-23 10:03:51,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-23 10:03:53,377 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-10-23 10:04:04,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-23 10:04:04,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-10-23 10:04:04,681 INFO L682 Elim1Store]: detected equality via solver [2018-10-23 10:04:04,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-23 10:04:04,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-23 10:04:04,688 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-23 10:04:04,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-23 10:04:04,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:04:04,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:04:04,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-23 10:04:04,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:52, output treesize:18 [2018-10-23 10:04:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 10 proven. 106 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-23 10:04:07,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-23 10:04:07,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24, 20] total 47 [2018-10-23 10:04:07,691 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-23 10:04:07,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-23 10:04:07,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-23 10:04:07,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1941, Unknown=8, NotChecked=0, Total=2162 [2018-10-23 10:04:07,693 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 29 states. [2018-10-23 10:04:25,767 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 47 [2018-10-23 10:04:26,161 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-23 10:04:36,175 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 90 [2018-10-23 10:04:38,958 WARN L179 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2018-10-23 10:04:44,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-23 10:04:44,084 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2018-10-23 10:04:44,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-23 10:04:44,085 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-10-23 10:04:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-23 10:04:44,086 INFO L225 Difference]: With dead ends: 143 [2018-10-23 10:04:44,086 INFO L226 Difference]: Without dead ends: 97 [2018-10-23 10:04:44,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 53.0s TimeCoverageRelationStatistics Valid=365, Invalid=3048, Unknown=9, NotChecked=0, Total=3422 [2018-10-23 10:04:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-23 10:04:44,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2018-10-23 10:04:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-23 10:04:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-10-23 10:04:44,108 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 69 [2018-10-23 10:04:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-23 10:04:44,108 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-10-23 10:04:44,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-23 10:04:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-10-23 10:04:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-23 10:04:44,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-23 10:04:44,110 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-23 10:04:44,110 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-23 10:04:44,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-23 10:04:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2020479489, now seen corresponding path program 6 times [2018-10-23 10:04:44,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-23 10:04:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:04:44,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-23 10:04:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-23 10:04:44,111 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-23 10:04:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-23 10:04:49,385 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 10 proven. 74 refuted. 3 times theorem prover too weak. 105 trivial. 0 not checked. [2018-10-23 10:04:49,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:04:49,385 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-23 10:04:49,386 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-23 10:04:49,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-23 10:04:49,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-23 10:04:49,386 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-23 10:04:49,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-23 10:04:49,393 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-23 10:04:49,441 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-23 10:04:49,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-23 10:04:49,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-23 10:04:56,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-10-23 10:04:56,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-23 10:04:56,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-23 10:04:56,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:04:56,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-23 10:04:56,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-23 10:04:56,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-10-23 10:04:56,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-10-23 10:04:56,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-23 10:04:56,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-23 10:04:56,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-23 10:04:56,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:59 [2018-10-23 10:04:58,906 WARN L179 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-10-23 10:05:00,195 WARN L179 SmtUtils]: Spent 900.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-23 10:05:00,847 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-23 10:05:02,437 WARN L179 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-10-23 10:05:02,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-10-23 10:05:02,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2018-10-23 10:05:02,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. Received shutdown request... [2018-10-23 10:05:02,598 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-23 10:05:02,798 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-23 10:05:02,799 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-23 10:05:02,804 WARN L205 ceAbstractionStarter]: Timeout [2018-10-23 10:05:02,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:05:02 BoogieIcfgContainer [2018-10-23 10:05:02,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-23 10:05:02,805 INFO L168 Benchmark]: Toolchain (without parser) took 278779.16 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 974.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -456.9 MB). Peak memory consumption was 517.2 MB. Max. memory is 7.1 GB. [2018-10-23 10:05:02,806 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-10-23 10:05:02,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 279.30 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-10-23 10:05:02,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.65 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-10-23 10:05:02,807 INFO L168 Benchmark]: Boogie Preprocessor took 24.14 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-10-23 10:05:02,807 INFO L168 Benchmark]: RCFGBuilder took 465.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. [2018-10-23 10:05:02,808 INFO L168 Benchmark]: TraceAbstraction took 277962.78 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 223.9 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 344.1 MB). Peak memory consumption was 568.0 MB. Max. memory is 7.1 GB. [2018-10-23 10:05:02,811 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 279.30 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 43.65 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 24.14 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 465.02 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -811.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 277962.78 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 223.9 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 344.1 MB). Peak memory consumption was 568.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 12). Cancelled while BasicCegarLoop was analyzing trace of length 82 with TraceHistMax 8,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 67. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. TIMEOUT Result, 277.9s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 139.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 233 SDtfs, 323 SDslu, 1637 SDs, 0 SdLazy, 1770 SolverSat, 202 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 80.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 362 SyntacticMatches, 35 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 2395 ImplicationChecksByTransitivity, 163.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.0s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 75 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 115.2s InterpolantComputationTime, 551 NumberOfCodeBlocks, 551 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 792 ConstructedInterpolants, 239 QuantifiedInterpolants, 775595 SizeOfPredicates, 132 NumberOfNonLiveVariables, 1059 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 230/918 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown