java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 16:50:55,076 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 16:50:55,078 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 16:50:55,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 16:50:55,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 16:50:55,093 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 16:50:55,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 16:50:55,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 16:50:55,098 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 16:50:55,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 16:50:55,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 16:50:55,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 16:50:55,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 16:50:55,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 16:50:55,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 16:50:55,104 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 16:50:55,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 16:50:55,108 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 16:50:55,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 16:50:55,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 16:50:55,113 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 16:50:55,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 16:50:55,114 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 16:50:55,115 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 16:50:55,116 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 16:50:55,117 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 16:50:55,117 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 16:50:55,118 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 16:50:55,118 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 16:50:55,118 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 16:50:55,119 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 16:50:55,119 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 16:50:55,129 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 16:50:55,129 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 16:50:55,130 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 16:50:55,131 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 16:50:55,131 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 16:50:55,131 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 16:50:55,131 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 16:50:55,131 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 16:50:55,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 16:50:55,132 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 16:50:55,132 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 16:50:55,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 16:50:55,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 16:50:55,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 16:50:55,133 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 16:50:55,133 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 16:50:55,134 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 16:50:55,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 16:50:55,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 16:50:55,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 16:50:55,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 16:50:55,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 16:50:55,135 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 16:50:55,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 16:50:55,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:50:55,136 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 16:50:55,136 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 16:50:55,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 16:50:55,136 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 16:50:55,136 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 16:50:55,136 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 16:50:55,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 16:50:55,137 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 16:50:55,137 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 16:50:55,138 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 16:50:55,138 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 16:50:55,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 16:50:55,187 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 16:50:55,191 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 16:50:55,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 16:50:55,194 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 16:50:55,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:50:55,370 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 16:50:55,376 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 16:50:55,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 16:50:55,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 16:50:55,382 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 16:50:55,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:50:55" (1/1) ... [2018-01-24 16:50:55,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aad67c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55, skipping insertion in model container [2018-01-24 16:50:55,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 04:50:55" (1/1) ... [2018-01-24 16:50:55,406 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:50:55,448 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 16:50:55,570 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:50:55,585 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 16:50:55,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55 WrapperNode [2018-01-24 16:50:55,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 16:50:55,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 16:50:55,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 16:50:55,592 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 16:50:55,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55" (1/1) ... [2018-01-24 16:50:55,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55" (1/1) ... [2018-01-24 16:50:55,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55" (1/1) ... [2018-01-24 16:50:55,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55" (1/1) ... [2018-01-24 16:50:55,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55" (1/1) ... [2018-01-24 16:50:55,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55" (1/1) ... [2018-01-24 16:50:55,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55" (1/1) ... [2018-01-24 16:50:55,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 16:50:55,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 16:50:55,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 16:50:55,636 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 16:50:55,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 16:50:55,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 16:50:55,701 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 16:50:55,701 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-01-24 16:50:55,702 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 16:50:55,702 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 16:50:55,702 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 16:50:55,702 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 16:50:55,702 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 16:50:55,702 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 16:50:55,703 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 16:50:55,703 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-01-24 16:50:55,703 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 16:50:55,703 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 16:50:55,703 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 16:50:55,922 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 16:50:55,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:50:55 BoogieIcfgContainer [2018-01-24 16:50:55,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 16:50:55,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 16:50:55,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 16:50:55,926 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 16:50:55,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 04:50:55" (1/3) ... [2018-01-24 16:50:55,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b1f773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:50:55, skipping insertion in model container [2018-01-24 16:50:55,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 04:50:55" (2/3) ... [2018-01-24 16:50:55,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b1f773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 04:50:55, skipping insertion in model container [2018-01-24 16:50:55,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 04:50:55" (3/3) ... [2018-01-24 16:50:55,929 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 16:50:55,935 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 16:50:55,942 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 16:50:55,984 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 16:50:55,984 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 16:50:55,984 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 16:50:55,984 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 16:50:55,984 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 16:50:55,985 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 16:50:55,985 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 16:50:55,985 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 16:50:55,986 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 16:50:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-24 16:50:56,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:50:56,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:56,013 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:50:56,013 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:50:56,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510132, now seen corresponding path program 1 times [2018-01-24 16:50:56,018 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:56,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:56,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:56,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:56,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:56,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:56,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:56,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:50:56,247 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:56,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:50:56,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:50:56,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:50:56,335 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 4 states. [2018-01-24 16:50:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:56,431 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-01-24 16:50:56,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:50:56,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 16:50:56,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:56,445 INFO L225 Difference]: With dead ends: 58 [2018-01-24 16:50:56,445 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 16:50:56,449 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:50:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 16:50:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 16:50:56,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 16:50:56,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 16:50:56,490 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2018-01-24 16:50:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:56,491 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 16:50:56,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:50:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 16:50:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 16:50:56,492 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:56,492 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:50:56,492 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:50:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash -2014510131, now seen corresponding path program 1 times [2018-01-24 16:50:56,492 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:56,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:56,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:56,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:56,494 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:56,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:56,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:56,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:50:56,637 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:56,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:50:56,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:50:56,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:50:56,642 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-24 16:50:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:56,780 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 16:50:56,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:50:56,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 16:50:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:56,782 INFO L225 Difference]: With dead ends: 41 [2018-01-24 16:50:56,783 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 16:50:56,784 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:50:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 16:50:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-24 16:50:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 16:50:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 16:50:56,791 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2018-01-24 16:50:56,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:56,791 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 16:50:56,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:50:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 16:50:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:50:56,792 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:56,792 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:50:56,792 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:50:56,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695343, now seen corresponding path program 1 times [2018-01-24 16:50:56,793 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:56,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:56,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:56,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:56,795 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:56,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:56,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:56,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 16:50:56,847 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:56,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 16:50:56,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 16:50:56,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 16:50:56,848 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 4 states. [2018-01-24 16:50:56,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:56,905 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-01-24 16:50:56,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 16:50:56,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 16:50:56,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:56,906 INFO L225 Difference]: With dead ends: 40 [2018-01-24 16:50:56,907 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 16:50:56,907 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:50:56,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 16:50:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-24 16:50:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 16:50:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 16:50:56,913 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 14 [2018-01-24 16:50:56,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:56,913 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 16:50:56,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 16:50:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 16:50:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 16:50:56,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:56,914 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:50:56,914 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:50:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1974695344, now seen corresponding path program 1 times [2018-01-24 16:50:56,915 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:56,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:56,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:56,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:56,916 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:56,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:57,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:57,020 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 16:50:57,020 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:57,020 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 16:50:57,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 16:50:57,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 16:50:57,021 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-24 16:50:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:57,062 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 16:50:57,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:50:57,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 16:50:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:57,064 INFO L225 Difference]: With dead ends: 39 [2018-01-24 16:50:57,064 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 16:50:57,064 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:50:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 16:50:57,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 16:50:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 16:50:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 16:50:57,070 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-01-24 16:50:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:57,070 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 16:50:57,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 16:50:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 16:50:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:50:57,071 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:57,071 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:50:57,071 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:50:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash -559562515, now seen corresponding path program 1 times [2018-01-24 16:50:57,072 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:57,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:57,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:57,073 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:57,073 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:57,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:57,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:57,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:57,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:50:57,147 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:57,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:50:57,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:50:57,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:50:57,148 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-01-24 16:50:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:57,242 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-01-24 16:50:57,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 16:50:57,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 16:50:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:57,243 INFO L225 Difference]: With dead ends: 38 [2018-01-24 16:50:57,243 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 16:50:57,244 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:50:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 16:50:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 16:50:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 16:50:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-24 16:50:57,250 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 18 [2018-01-24 16:50:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:57,250 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-24 16:50:57,250 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:50:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-24 16:50:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 16:50:57,251 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:57,251 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:50:57,252 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:50:57,252 INFO L82 PathProgramCache]: Analyzing trace with hash -559562514, now seen corresponding path program 1 times [2018-01-24 16:50:57,252 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:57,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:57,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:57,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:57,253 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:57,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:57,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:57,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 16:50:57,400 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:57,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 16:50:57,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 16:50:57,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 16:50:57,401 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-01-24 16:50:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:57,519 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 16:50:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:50:57,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-01-24 16:50:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:57,520 INFO L225 Difference]: With dead ends: 41 [2018-01-24 16:50:57,520 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 16:50:57,521 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:50:57,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 16:50:57,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-24 16:50:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 16:50:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 16:50:57,525 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-01-24 16:50:57,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:57,525 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 16:50:57,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 16:50:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 16:50:57,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:50:57,526 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:57,526 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:50:57,526 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:50:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796544, now seen corresponding path program 1 times [2018-01-24 16:50:57,526 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:57,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:57,527 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:57,527 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:57,527 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:57,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:57,579 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:57,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 16:50:57,580 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:57,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 16:50:57,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 16:50:57,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 16:50:57,581 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 7 states. [2018-01-24 16:50:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:57,682 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-01-24 16:50:57,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 16:50:57,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-01-24 16:50:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:57,683 INFO L225 Difference]: With dead ends: 40 [2018-01-24 16:50:57,683 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 16:50:57,684 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:50:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 16:50:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-01-24 16:50:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 16:50:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 16:50:57,687 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 21 [2018-01-24 16:50:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:57,688 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 16:50:57,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 16:50:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 16:50:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 16:50:57,688 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:57,689 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:50:57,689 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:50:57,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1158796543, now seen corresponding path program 1 times [2018-01-24 16:50:57,689 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:57,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:57,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:57,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:57,690 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:57,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:57,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:57,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:50:57,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 16:50:57,807 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:57,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 16:50:57,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 16:50:57,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 16:50:57,808 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-01-24 16:50:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:50:57,925 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-01-24 16:50:57,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 16:50:57,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-01-24 16:50:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:50:57,926 INFO L225 Difference]: With dead ends: 43 [2018-01-24 16:50:57,927 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 16:50:57,927 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-24 16:50:57,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 16:50:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-01-24 16:50:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 16:50:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-24 16:50:57,931 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 21 [2018-01-24 16:50:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:50:57,932 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-24 16:50:57,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 16:50:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-24 16:50:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:50:57,932 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:50:57,932 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:50:57,932 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:50:57,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1264210553, now seen corresponding path program 1 times [2018-01-24 16:50:57,933 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:50:57,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:57,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:57,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:50:57,934 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:50:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:57,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:50:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:58,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:50:58,683 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:50:58,683 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 16:50:58,685 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [20], [21], [22], [25], [36], [38], [39], [41], [42], [46], [47], [50], [55], [58], [67], [68], [69], [71] [2018-01-24 16:50:58,728 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:50:58,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:50:58,965 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:50:58,966 INFO L268 AbstractInterpreter]: Visited 25 different actions 34 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 16:50:58,998 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:50:58,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:50:58,999 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:50:59,007 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:50:59,007 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:50:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:50:59,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:50:59,151 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 6 treesize of output 5 [2018-01-24 16:50:59,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:50:59,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:50:59,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:50:59,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:50:59,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 16:50:59,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-01-24 16:50:59,273 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-01-24 16:50:59,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-01-24 16:50:59,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 [2018-01-24 16:50:59,342 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 11 treesize of output 10 [2018-01-24 16:50:59,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 16:50:59,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-01-24 16:50:59,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-24 16:50:59,545 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:50:59,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,550 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 16:50:59,550 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2018-01-24 16:50:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:59,659 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:50:59,870 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 13 treesize of output 11 [2018-01-24 16:50:59,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:50:59,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:50:59,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-01-24 16:50:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:50:59,972 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 16:50:59,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 11] imperfect sequences [20] total 40 [2018-01-24 16:50:59,972 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:50:59,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 16:50:59,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 16:50:59,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1432, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 16:50:59,973 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 15 states. [2018-01-24 16:51:02,398 WARN L143 SmtUtils]: Spent 2160ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-24 16:51:04,993 WARN L143 SmtUtils]: Spent 2569ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-24 16:51:07,878 WARN L143 SmtUtils]: Spent 2859ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-24 16:51:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:51:08,019 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-24 16:51:08,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 16:51:08,019 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-01-24 16:51:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:51:08,020 INFO L225 Difference]: With dead ends: 93 [2018-01-24 16:51:08,020 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 16:51:08,022 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=257, Invalid=2395, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 16:51:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 16:51:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2018-01-24 16:51:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 16:51:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-24 16:51:08,031 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 26 [2018-01-24 16:51:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:51:08,032 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-24 16:51:08,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 16:51:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-24 16:51:08,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:51:08,033 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:51:08,033 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:51:08,033 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:51:08,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1264212731, now seen corresponding path program 1 times [2018-01-24 16:51:08,034 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:51:08,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:08,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:51:08,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:08,035 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:51:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:08,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:51:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:08,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:08,619 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:51:08,619 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 16:51:08,620 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [20], [21], [22], [25], [36], [38], [39], [42], [46], [47], [49], [50], [55], [60], [67], [68], [69], [71] [2018-01-24 16:51:08,621 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:51:08,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:51:08,748 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:51:08,748 INFO L268 AbstractInterpreter]: Visited 25 different actions 35 times. Merged at 6 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 16:51:08,751 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:51:08,751 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:08,751 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:51:08,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:51:08,766 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:51:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:08,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:51:08,833 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 14 treesize of output 11 [2018-01-24 16:51:08,847 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 11 treesize of output 10 [2018-01-24 16:51:08,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:08,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:08,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:51:08,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:51:09,042 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 16 [2018-01-24 16:51:09,048 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:51:09,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:09,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:09,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:09,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 16:51:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:09,295 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:51:09,594 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 16 treesize of output 12 [2018-01-24 16:51:09,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:09,601 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 15 treesize of output 13 [2018-01-24 16:51:09,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 16:51:09,609 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:09,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:09,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:09,615 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-24 16:51:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:09,642 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:09,642 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:51:09,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:51:09,645 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:51:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:09,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:51:09,872 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 6 treesize of output 5 [2018-01-24 16:51:09,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:09,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:09,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-24 16:51:09,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:09,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:09,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:51:09,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:09,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 16:51:09,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:09,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:09,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 16:51:10,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-01-24 16:51:10,057 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-01-24 16:51:10,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:10,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:10,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:10,096 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-01-24 16:51:10,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 24 treesize of output 25 [2018-01-24 16:51:10,136 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 13 treesize of output 12 [2018-01-24 16:51:10,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:10,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:10,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:10,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-01-24 16:51:10,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-01-24 16:51:10,546 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 16:51:10,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:10,555 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:51:10,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:10,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:10,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:10,569 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:36 [2018-01-24 16:51:10,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:10,719 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:51:11,101 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2018-01-24 16:51:11,116 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 12 treesize of output 11 [2018-01-24 16:51:11,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:11,129 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-01-24 16:51:11,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:51:11,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:11,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:11,161 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 42 treesize of output 42 [2018-01-24 16:51:11,198 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 1 case distinctions, treesize of input 28 treesize of output 28 [2018-01-24 16:51:11,199 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:11,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-01-24 16:51:11,213 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:11,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2018-01-24 16:51:11,228 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:11,244 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:11,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-24 16:51:11,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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-01-24 16:51:11,256 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:11,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-01-24 16:51:11,263 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:11,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-01-24 16:51:11,265 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:11,269 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:11,274 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 36 treesize of output 38 [2018-01-24 16:51:11,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 39 [2018-01-24 16:51:11,305 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-01-24 16:51:11,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34 [2018-01-24 16:51:11,312 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:11,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-24 16:51:11,314 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:11,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-01-24 16:51:11,346 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:11,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 16:51:11,367 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:11,382 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 16:51:11,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-01-24 16:51:11,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-01-24 16:51:11,427 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 1 variables, input treesize:72, output treesize:113 [2018-01-24 16:51:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:11,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:51:11,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11, 19, 19] total 63 [2018-01-24 16:51:11,973 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:51:11,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 16:51:11,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 16:51:11,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=3766, Unknown=0, NotChecked=0, Total=4032 [2018-01-24 16:51:11,974 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 21 states. [2018-01-24 16:51:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:51:17,401 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2018-01-24 16:51:17,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-24 16:51:17,402 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2018-01-24 16:51:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:51:17,406 INFO L225 Difference]: With dead ends: 128 [2018-01-24 16:51:17,406 INFO L226 Difference]: Without dead ends: 127 [2018-01-24 16:51:17,409 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2320 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=766, Invalid=8354, Unknown=0, NotChecked=0, Total=9120 [2018-01-24 16:51:17,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-24 16:51:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 72. [2018-01-24 16:51:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 16:51:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2018-01-24 16:51:17,424 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 26 [2018-01-24 16:51:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:51:17,424 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2018-01-24 16:51:17,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-24 16:51:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2018-01-24 16:51:17,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 16:51:17,425 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:51:17,425 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:51:17,426 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:51:17,426 INFO L82 PathProgramCache]: Analyzing trace with hash 446562103, now seen corresponding path program 1 times [2018-01-24 16:51:17,426 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:51:17,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:17,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:51:17,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:17,427 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:51:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:17,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:51:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:17,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:17,959 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:51:17,959 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 16:51:17,960 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [36], [38], [39], [41], [42], [46], [47], [50], [55], [58], [67], [68], [69], [71] [2018-01-24 16:51:17,961 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:51:17,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:51:18,061 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:51:18,061 INFO L268 AbstractInterpreter]: Visited 25 different actions 34 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 16:51:18,064 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:51:18,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:18,064 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:51:18,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:51:18,078 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:51:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:18,102 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:51:18,112 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 6 treesize of output 5 [2018-01-24 16:51:18,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:18,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:18,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:51:18,440 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:18,453 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:18,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:51:18,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:18,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:18,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 16:51:18,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 16:51:18,551 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 11 treesize of output 10 [2018-01-24 16:51:18,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:18,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:18,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:51:18,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 16:51:18,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 26 [2018-01-24 16:51:18,604 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 11 treesize of output 10 [2018-01-24 16:51:18,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:18,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:18,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 16:51:18,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 16:51:18,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-24 16:51:18,827 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 16:51:18,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:18,836 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 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:51:18,836 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:18,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:18,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:18,848 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-24 16:51:18,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:18,955 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:51:19,336 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 16 treesize of output 12 [2018-01-24 16:51:19,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,342 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 15 treesize of output 13 [2018-01-24 16:51:19,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 16:51:19,350 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,356 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-01-24 16:51:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:19,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:19,410 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:51:19,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:51:19,419 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:51:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:19,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:51:19,469 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 6 treesize of output 5 [2018-01-24 16:51:19,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,474 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 6 treesize of output 5 [2018-01-24 16:51:19,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:51:19,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:19,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:51:19,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:19,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:19,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:51:19,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 16:51:19,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:51:19,634 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 13 treesize of output 12 [2018-01-24 16:51:19,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 16:51:19,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 29 treesize of output 30 [2018-01-24 16:51:19,691 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 13 treesize of output 12 [2018-01-24 16:51:19,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 16:51:19,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 16:51:19,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 16:51:19,930 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 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:51:19,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:19,936 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-24 16:51:19,937 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:19,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:19,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:19,945 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-01-24 16:51:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:20,210 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:51:20,549 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 13 treesize of output 11 [2018-01-24 16:51:20,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:51:20,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:20,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:20,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:20,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 16:51:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:20,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:51:20,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 12, 15, 14] total 64 [2018-01-24 16:51:20,795 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:51:20,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 16:51:20,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 16:51:20,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=3900, Unknown=0, NotChecked=0, Total=4160 [2018-01-24 16:51:20,797 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 33 states. [2018-01-24 16:51:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:51:22,431 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2018-01-24 16:51:22,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 16:51:22,431 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 26 [2018-01-24 16:51:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:51:22,432 INFO L225 Difference]: With dead ends: 93 [2018-01-24 16:51:22,433 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 16:51:22,434 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=525, Invalid=6117, Unknown=0, NotChecked=0, Total=6642 [2018-01-24 16:51:22,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 16:51:22,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2018-01-24 16:51:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-24 16:51:22,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2018-01-24 16:51:22,452 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 26 [2018-01-24 16:51:22,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:51:22,452 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2018-01-24 16:51:22,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 16:51:22,453 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2018-01-24 16:51:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 16:51:22,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:51:22,454 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:51:22,454 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:51:22,454 INFO L82 PathProgramCache]: Analyzing trace with hash -53536959, now seen corresponding path program 2 times [2018-01-24 16:51:22,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:51:22,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:22,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:51:22,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:22,455 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:51:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:22,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:51:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:22,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:22,765 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:51:22,765 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:51:22,765 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:51:22,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:22,766 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:51:22,776 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:51:22,776 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:51:22,789 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:51:22,796 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:51:22,799 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:51:22,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:51:22,836 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 14 treesize of output 11 [2018-01-24 16:51:22,850 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 11 treesize of output 10 [2018-01-24 16:51:22,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:22,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:22,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:51:22,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 16:51:23,185 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 30 treesize of output 24 [2018-01-24 16:51:23,188 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:23,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-01-24 16:51:23,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:23,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:23,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:23,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:43 [2018-01-24 16:51:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:23,311 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:51:23,836 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 16 treesize of output 12 [2018-01-24 16:51:23,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:23,845 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 29 treesize of output 25 [2018-01-24 16:51:23,864 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:23,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 16:51:23,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:23,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:23,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:23,878 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:50, output treesize:10 [2018-01-24 16:51:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:23,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:23,923 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:51:23,926 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:51:23,927 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:51:23,945 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:51:23,968 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:51:24,002 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:51:24,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:51:24,019 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 6 treesize of output 5 [2018-01-24 16:51:24,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:24,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:24,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:51:24,029 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 15 treesize of output 12 [2018-01-24 16:51:24,039 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 12 treesize of output 11 [2018-01-24 16:51:24,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:24,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:24,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:24,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 16:51:24,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 21 treesize of output 17 [2018-01-24 16:51:24,333 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 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-24 16:51:24,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:24,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:24,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:24,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 16:51:24,374 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:24,374 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:51:24,884 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 15 treesize of output 13 [2018-01-24 16:51:24,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 16:51:24,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:24,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:24,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:24,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 16:51:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:25,035 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:51:25,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15, 14, 14] total 55 [2018-01-24 16:51:25,035 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:51:25,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 16:51:25,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 16:51:25,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2898, Unknown=0, NotChecked=0, Total=3080 [2018-01-24 16:51:25,037 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 27 states. [2018-01-24 16:51:31,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:51:31,362 INFO L93 Difference]: Finished difference Result 170 states and 203 transitions. [2018-01-24 16:51:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-24 16:51:31,363 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 31 [2018-01-24 16:51:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:51:31,365 INFO L225 Difference]: With dead ends: 170 [2018-01-24 16:51:31,365 INFO L226 Difference]: Without dead ends: 169 [2018-01-24 16:51:31,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1490 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=841, Invalid=7531, Unknown=0, NotChecked=0, Total=8372 [2018-01-24 16:51:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-01-24 16:51:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 108. [2018-01-24 16:51:31,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-24 16:51:31,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2018-01-24 16:51:31,387 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 31 [2018-01-24 16:51:31,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:51:31,387 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2018-01-24 16:51:31,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 16:51:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2018-01-24 16:51:31,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 16:51:31,389 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:51:31,389 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:51:31,389 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:51:31,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1129910615, now seen corresponding path program 1 times [2018-01-24 16:51:31,389 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:51:31,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:31,390 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:51:31,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:31,391 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:51:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:31,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:51:31,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:31,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 16:51:31,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 16:51:31,498 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 16:51:31,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 16:51:31,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 16:51:31,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 16:51:31,498 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand 6 states. [2018-01-24 16:51:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:51:31,663 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2018-01-24 16:51:31,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 16:51:31,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-24 16:51:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:51:31,664 INFO L225 Difference]: With dead ends: 108 [2018-01-24 16:51:31,664 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 16:51:31,665 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 16:51:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 16:51:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-24 16:51:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 16:51:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-01-24 16:51:31,678 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 32 [2018-01-24 16:51:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:51:31,678 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-01-24 16:51:31,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 16:51:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2018-01-24 16:51:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 16:51:31,679 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:51:31,679 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:51:31,679 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:51:31,679 INFO L82 PathProgramCache]: Analyzing trace with hash -373803070, now seen corresponding path program 2 times [2018-01-24 16:51:31,680 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:51:31,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:31,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:51:31,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:31,681 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:51:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:31,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:51:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:32,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:32,106 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:51:32,106 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 16:51:32,106 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 16:51:32,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:32,106 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:51:32,111 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:51:32,111 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:51:32,122 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:51:32,128 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:51:32,131 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:51:32,134 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:51:32,137 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 6 treesize of output 5 [2018-01-24 16:51:32,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,142 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 6 treesize of output 5 [2018-01-24 16:51:32,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:51:32,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:32,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:51:32,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:32,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:32,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:51:32,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-24 16:51:32,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 16:51:32,249 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 13 treesize of output 12 [2018-01-24 16:51:32,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:51:32,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-01-24 16:51:32,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 29 treesize of output 30 [2018-01-24 16:51:32,288 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 13 treesize of output 12 [2018-01-24 16:51:32,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 16:51:32,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-01-24 16:51:32,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2018-01-24 16:51:32,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-24 16:51:32,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:32,942 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 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-24 16:51:32,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:32,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:32,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 16:51:32,963 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:66, output treesize:69 [2018-01-24 16:51:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:33,267 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:51:34,352 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 55 [2018-01-24 16:51:34,375 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 12 treesize of output 11 [2018-01-24 16:51:34,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:34,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-01-24 16:51:34,402 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:34,402 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:34,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2018-01-24 16:51:34,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:34,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:51:34,409 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:34,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:34,418 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 50 treesize of output 50 [2018-01-24 16:51:34,461 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:34,462 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:34,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-01-24 16:51:34,463 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:34,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-24 16:51:34,481 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:34,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-01-24 16:51:34,497 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:34,509 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:34,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:34,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:34,539 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:112, output treesize:198 [2018-01-24 16:51:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:34,935 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:34,936 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:51:34,939 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 16:51:34,939 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 16:51:34,952 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:51:34,974 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 16:51:35,012 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 16:51:35,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:51:35,025 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 6 treesize of output 5 [2018-01-24 16:51:35,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,033 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 6 treesize of output 5 [2018-01-24 16:51:35,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 16:51:35,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:35,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 16:51:35,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:35,063 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:35,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 16:51:35,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-24 16:51:35,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 16:51:35,173 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 12 treesize of output 11 [2018-01-24 16:51:35,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-01-24 16:51:35,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 29 [2018-01-24 16:51:35,234 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 13 treesize of output 12 [2018-01-24 16:51:35,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:35,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-24 16:51:36,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-01-24 16:51:36,320 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 1 case distinctions, treesize of input 22 treesize of output 20 [2018-01-24 16:51:36,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:36,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:36,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:36,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 37 [2018-01-24 16:51:36,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:36,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:36,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 16:51:36,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2018-01-24 16:51:36,352 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:36,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-01-24 16:51:36,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-01-24 16:51:36,399 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:93 [2018-01-24 16:51:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:36,746 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:51:38,314 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 84 [2018-01-24 16:51:38,353 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 12 treesize of output 11 [2018-01-24 16:51:38,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,373 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 75 treesize of output 71 [2018-01-24 16:51:38,431 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,431 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,431 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,432 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2018-01-24 16:51:38,432 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-01-24 16:51:38,455 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,476 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 50 [2018-01-24 16:51:38,478 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:38,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2018-01-24 16:51:38,527 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,527 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,527 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,528 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-24 16:51:38,528 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:51:38,543 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,548 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2018-01-24 16:51:38,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-01-24 16:51:38,572 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,579 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-01-24 16:51:38,580 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,586 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2018-01-24 16:51:38,614 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,614 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,615 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,615 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 16:51:38,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-01-24 16:51:38,616 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 16:51:38,625 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,631 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:38,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:38,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:38,674 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 3 variables, input treesize:171, output treesize:492 [2018-01-24 16:51:38,964 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 56 DAG size of output 49 [2018-01-24 16:51:47,550 WARN L146 SmtUtils]: Spent 8108ms on a formula simplification. DAG size of input: 189 DAG size of output 54 [2018-01-24 16:51:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:47,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 16:51:47,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24, 24, 25, 25] total 101 [2018-01-24 16:51:47,729 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 16:51:47,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-24 16:51:47,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-24 16:51:47,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=9571, Unknown=0, NotChecked=0, Total=10302 [2018-01-24 16:51:47,732 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 40 states. [2018-01-24 16:51:51,636 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 102 DAG size of output 65 [2018-01-24 16:51:52,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 16:51:52,360 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2018-01-24 16:51:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-24 16:51:52,360 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 34 [2018-01-24 16:51:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 16:51:52,361 INFO L225 Difference]: With dead ends: 95 [2018-01-24 16:51:52,361 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 16:51:52,365 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 4872 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=1851, Invalid=16239, Unknown=0, NotChecked=0, Total=18090 [2018-01-24 16:51:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 16:51:52,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 55. [2018-01-24 16:51:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 16:51:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-01-24 16:51:52,376 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 34 [2018-01-24 16:51:52,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 16:51:52,376 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-01-24 16:51:52,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-01-24 16:51:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-01-24 16:51:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 16:51:52,377 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 16:51:52,377 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 16:51:52,377 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr3RequiresViolation]=== [2018-01-24 16:51:52,377 INFO L82 PathProgramCache]: Analyzing trace with hash 885459716, now seen corresponding path program 1 times [2018-01-24 16:51:52,378 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 16:51:52,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:52,378 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 16:51:52,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 16:51:52,378 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 16:51:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:52,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 16:51:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 16:51:52,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:52,791 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 16:51:52,791 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-01-24 16:51:52,791 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [36], [38], [39], [42], [46], [47], [49], [50], [55], [58], [60], [67], [68], [69], [71] [2018-01-24 16:51:52,793 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 16:51:52,793 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 16:51:52,952 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 16:51:52,953 INFO L268 AbstractInterpreter]: Visited 26 different actions 53 times. Merged at 10 different actions 23 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 30 variables. [2018-01-24 16:51:52,958 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 16:51:52,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:52,958 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 16:51:52,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:51:52,965 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:51:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:52,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:51:53,003 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 6 treesize of output 5 [2018-01-24 16:51:53,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:53,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:53,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:51:53,063 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 15 treesize of output 12 [2018-01-24 16:51:53,066 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 12 treesize of output 11 [2018-01-24 16:51:53,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:53,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:53,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:53,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 16:51:53,269 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 21 treesize of output 17 [2018-01-24 16:51:53,276 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 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-24 16:51:53,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:53,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:53,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:53,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 16:51:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 8 proven. 64 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 16:51:53,423 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 16:51:53,945 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 15 treesize of output 13 [2018-01-24 16:51:53,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 16:51:53,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:53,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:53,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 16:51:53,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 16:51:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 5 proven. 67 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-24 16:51:54,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 16:51:54,083 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 16:51:54,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 16:51:54,086 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 16:51:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 16:51:54,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 16:51:54,178 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 6 treesize of output 5 [2018-01-24 16:51:54,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:54,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:54,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 16:51:54,187 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 16 treesize of output 13 [2018-01-24 16:51:54,188 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 13 treesize of output 12 [2018-01-24 16:51:54,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:54,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:54,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 16:51:54,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 16:51:54,430 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 26 treesize of output 28 [2018-01-24 16:51:54,432 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-01-24 16:51:54,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 16:51:54,462 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 33 [2018-01-24 16:51:54,462 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-01-24 16:51:54,498 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 1 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 16:51:54,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 16:51:54,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-01-24 16:51:54,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-01-24 16:51:54,560 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:92 Received shutdown request... [2018-01-24 16:51:54,896 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 16:51:54,897 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 16:51:54,900 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 16:51:54,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 04:51:54 BoogieIcfgContainer [2018-01-24 16:51:54,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 16:51:54,901 INFO L168 Benchmark]: Toolchain (without parser) took 59530.46 ms. Allocated memory was 300.9 MB in the beginning and 670.6 MB in the end (delta: 369.6 MB). Free memory was 261.0 MB in the beginning and 519.7 MB in the end (delta: -258.7 MB). Peak memory consumption was 110.9 MB. Max. memory is 5.3 GB. [2018-01-24 16:51:54,902 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 16:51:54,902 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.45 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 16:51:54,902 INFO L168 Benchmark]: Boogie Preprocessor took 43.25 ms. Allocated memory is still 300.9 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 16:51:54,903 INFO L168 Benchmark]: RCFGBuilder took 287.93 ms. Allocated memory is still 300.9 MB. Free memory was 247.8 MB in the beginning and 231.2 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 16:51:54,903 INFO L168 Benchmark]: TraceAbstraction took 58976.61 ms. Allocated memory was 300.9 MB in the beginning and 670.6 MB in the end (delta: 369.6 MB). Free memory was 230.2 MB in the beginning and 519.7 MB in the end (delta: -289.5 MB). Peak memory consumption was 80.1 MB. Max. memory is 5.3 GB. [2018-01-24 16:51:54,905 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 300.9 MB. Free memory is still 267.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.45 ms. Allocated memory is still 300.9 MB. Free memory was 260.0 MB in the beginning and 249.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.25 ms. Allocated memory is still 300.9 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 287.93 ms. Allocated memory is still 300.9 MB. Free memory was 247.8 MB in the beginning and 231.2 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58976.61 ms. Allocated memory was 300.9 MB in the beginning and 670.6 MB in the end (delta: 369.6 MB). Free memory was 230.2 MB in the beginning and 519.7 MB in the end (delta: -289.5 MB). Peak memory consumption was 80.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 274 LocStat_NO_SUPPORTING_DISEQUALITIES : 51 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.592541 RENAME_VARIABLES(MILLISECONDS) : 0.330425 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.541727 PROJECTAWAY(MILLISECONDS) : 0.087196 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001613 DISJOIN(MILLISECONDS) : 0.569237 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.369279 ADD_EQUALITY(MILLISECONDS) : 0.040860 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019219 #CONJOIN_DISJUNCTIVE : 63 #RENAME_VARIABLES : 98 #UNFREEZE : 0 #CONJOIN : 112 #PROJECTAWAY : 82 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 11 #RENAME_VARIABLES_DISJUNCTIVE : 95 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 269 LocStat_NO_SUPPORTING_DISEQUALITIES : 52 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 63 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.428910 RENAME_VARIABLES(MILLISECONDS) : 0.255910 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.398588 PROJECTAWAY(MILLISECONDS) : 0.126510 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001200 DISJOIN(MILLISECONDS) : 0.277080 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.279474 ADD_EQUALITY(MILLISECONDS) : 0.017864 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.024693 #CONJOIN_DISJUNCTIVE : 65 #RENAME_VARIABLES : 104 #UNFREEZE : 0 #CONJOIN : 116 #PROJECTAWAY : 86 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 99 #ADD_EQUALITY : 65 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 274 LocStat_NO_SUPPORTING_DISEQUALITIES : 49 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.315927 RENAME_VARIABLES(MILLISECONDS) : 0.156588 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.283459 PROJECTAWAY(MILLISECONDS) : 0.065259 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000744 DISJOIN(MILLISECONDS) : 0.338477 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.177471 ADD_EQUALITY(MILLISECONDS) : 0.033687 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016150 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 98 #UNFREEZE : 0 #CONJOIN : 111 #PROJECTAWAY : 82 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 11 #RENAME_VARIABLES_DISJUNCTIVE : 95 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 264 LocStat_NO_SUPPORTING_DISEQUALITIES : 49 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.347853 RENAME_VARIABLES(MILLISECONDS) : 0.191513 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.312150 PROJECTAWAY(MILLISECONDS) : 0.063471 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000723 DISJOIN(MILLISECONDS) : 0.478595 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.219750 ADD_EQUALITY(MILLISECONDS) : 0.021030 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009319 #CONJOIN_DISJUNCTIVE : 91 #RENAME_VARIABLES : 159 #UNFREEZE : 0 #CONJOIN : 143 #PROJECTAWAY : 115 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 12 #RENAME_VARIABLES_DISJUNCTIVE : 153 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 55 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 60 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 9 error locations. TIMEOUT Result, 58.9s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 27.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 408 SDtfs, 1389 SDslu, 2210 SDs, 0 SdLazy, 2871 SolverSat, 451 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 798 GetRequests, 277 SyntacticMatches, 15 SemanticMatches, 506 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 10473 ImplicationChecksByTransitivity, 43.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 173 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 27.5s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 795 ConstructedInterpolants, 135 QuantifiedInterpolants, 389982 SizeOfPredicates, 211 NumberOfNonLiveVariables, 1371 ConjunctsInSsa, 491 ConjunctsInUnsatCore, 32 InterpolantComputations, 11 PerfectInterpolantSequences, 14/131 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_16-51-54-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_16-51-54-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_16-51-54-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_16-51-54-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_16-51-54-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_16-51-54-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_16-51-54-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_16-51-54-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_16-51-54-920.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_16-51-54-920.csv Completed graceful shutdown