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.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:17:55,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:17:55,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:17:55,383 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:17:55,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:17:55,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:17:55,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:17:55,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:17:55,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:17:55,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:17:55,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:17:55,390 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:17:55,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:17:55,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:17:55,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:17:55,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:17:55,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:17:55,399 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:17:55,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:17:55,402 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:17:55,404 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:17:55,404 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:17:55,404 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:17:55,405 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:17:55,406 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:17:55,408 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:17:55,408 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:17:55,408 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:17:55,409 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:17:55,409 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:17:55,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:17:55,410 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.epf [2018-01-24 15:17:55,457 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:17:55,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:17:55,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:17:55,459 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:17:55,459 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:17:55,459 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:17:55,459 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:17:55,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:17:55,460 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:17:55,460 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:17:55,460 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:17:55,461 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:17:55,461 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:17:55,461 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:17:55,461 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:17:55,461 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:17:55,462 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:17:55,462 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:17:55,462 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:17:55,462 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:17:55,462 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:17:55,463 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:17:55,463 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:17:55,463 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:17:55,463 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:17:55,463 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:17:55,464 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:17:55,464 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:17:55,464 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:17:55,464 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:17:55,464 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:17:55,465 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:17:55,465 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:17:55,466 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:17:55,466 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:17:55,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:17:55,513 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:17:55,517 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:17:55,519 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:17:55,519 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:17:55,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:17:55,694 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:17:55,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:17:55,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:17:55,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:17:55,710 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:17:55,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:17:55" (1/1) ... [2018-01-24 15:17:55,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0999f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17:55, skipping insertion in model container [2018-01-24 15:17:55,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:17:55" (1/1) ... [2018-01-24 15:17:55,734 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:17:55,773 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:17:55,893 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:17:55,916 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:17:55,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17:55 WrapperNode [2018-01-24 15:17:55,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:17:55,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:17:55,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:17:55,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:17:55,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17:55" (1/1) ... [2018-01-24 15:17:55,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17:55" (1/1) ... [2018-01-24 15:17:55,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17:55" (1/1) ... [2018-01-24 15:17:55,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17:55" (1/1) ... [2018-01-24 15:17:55,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17:55" (1/1) ... [2018-01-24 15:17:55,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17:55" (1/1) ... [2018-01-24 15:17:55,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17:55" (1/1) ... [2018-01-24 15:17:55,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:17:55,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:17:55,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:17:55,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:17:55,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17: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 15:17:56,004 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:17:56,005 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:17:56,005 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-24 15:17:56,005 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:17:56,005 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:17:56,005 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:17:56,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:17:56,005 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:17:56,005 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:17:56,005 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:17:56,006 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-24 15:17:56,006 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:17:56,006 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:17:56,006 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:17:56,204 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:17:56,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:17:56 BoogieIcfgContainer [2018-01-24 15:17:56,205 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:17:56,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:17:56,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:17:56,207 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:17:56,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:17:55" (1/3) ... [2018-01-24 15:17:56,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de18182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:17:56, skipping insertion in model container [2018-01-24 15:17:56,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:17:55" (2/3) ... [2018-01-24 15:17:56,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de18182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:17:56, skipping insertion in model container [2018-01-24 15:17:56,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:17:56" (3/3) ... [2018-01-24 15:17:56,211 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:17:56,218 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:17:56,223 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-24 15:17:56,268 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:17:56,268 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:17:56,268 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:17:56,268 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:17:56,269 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:17:56,269 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:17:56,269 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:17:56,269 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:17:56,270 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:17:56,289 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-01-24 15:17:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 15:17:56,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:56,297 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:17:56,297 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:56,302 INFO L82 PathProgramCache]: Analyzing trace with hash 967400660, now seen corresponding path program 1 times [2018-01-24 15:17:56,305 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:56,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:56,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:56,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:56,355 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:56,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:56,461 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 15:17:56,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:17:56,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 15:17:56,463 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:17:56,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:17:56,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:17:56,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:17:56,477 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-01-24 15:17:56,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:17:56,655 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 15:17:56,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:17:56,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 15:17:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:17:56,668 INFO L225 Difference]: With dead ends: 73 [2018-01-24 15:17:56,668 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 15:17:56,672 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:17:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 15:17:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 15:17:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 15:17:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-24 15:17:56,712 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2018-01-24 15:17:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:17:56,713 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-24 15:17:56,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:17:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-24 15:17:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:17:56,714 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:56,714 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:17:56,714 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:56,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837349, now seen corresponding path program 1 times [2018-01-24 15:17:56,715 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:56,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:56,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:56,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:56,716 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:56,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:56,813 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 15:17:56,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:17:56,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:17:56,814 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:17:56,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:17:56,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:17:56,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:17:56,817 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-01-24 15:17:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:17:56,888 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-01-24 15:17:56,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:17:56,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 15:17:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:17:56,889 INFO L225 Difference]: With dead ends: 47 [2018-01-24 15:17:56,889 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:17:56,890 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 15:17:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:17:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 15:17:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:17:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 15:17:56,896 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-01-24 15:17:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:17:56,897 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 15:17:56,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:17:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 15:17:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 15:17:56,898 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:56,898 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:17:56,898 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837350, now seen corresponding path program 1 times [2018-01-24 15:17:56,898 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:56,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:56,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:56,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:56,899 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:56,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:57,032 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 15:17:57,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:17:57,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:17:57,032 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:17:57,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:17:57,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:17:57,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:17:57,033 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-01-24 15:17:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:17:57,131 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-24 15:17:57,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:17:57,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 15:17:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:17:57,133 INFO L225 Difference]: With dead ends: 46 [2018-01-24 15:17:57,133 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 15:17:57,134 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:17:57,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 15:17:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 15:17:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 15:17:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-24 15:17:57,140 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-01-24 15:17:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:17:57,141 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-24 15:17:57,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:17:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-24 15:17:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:17:57,142 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:57,142 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:17:57,142 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:57,142 INFO L82 PathProgramCache]: Analyzing trace with hash -346682393, now seen corresponding path program 1 times [2018-01-24 15:17:57,142 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:57,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:57,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:57,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:57,144 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:57,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:57,201 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 15:17:57,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:17:57,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:17:57,202 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:17:57,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:17:57,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:17:57,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:17:57,202 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 4 states. [2018-01-24 15:17:57,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:17:57,253 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-24 15:17:57,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:17:57,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 15:17:57,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:17:57,254 INFO L225 Difference]: With dead ends: 45 [2018-01-24 15:17:57,254 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 15:17:57,255 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 15:17:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 15:17:57,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 15:17:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 15:17:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 15:17:57,260 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 16 [2018-01-24 15:17:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:17:57,261 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 15:17:57,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:17:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 15:17:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:17:57,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:57,261 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:17:57,261 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash -346682392, now seen corresponding path program 1 times [2018-01-24 15:17:57,262 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:57,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:57,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:57,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:57,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:57,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:57,340 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 15:17:57,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:17:57,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:17:57,340 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:17:57,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:17:57,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:17:57,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:17:57,341 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 15:17:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:17:57,444 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-24 15:17:57,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:17:57,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 15:17:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:17:57,446 INFO L225 Difference]: With dead ends: 60 [2018-01-24 15:17:57,446 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 15:17:57,447 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:17:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 15:17:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-01-24 15:17:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:17:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-24 15:17:57,458 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2018-01-24 15:17:57,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:17:57,458 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-24 15:17:57,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:17:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-24 15:17:57,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 15:17:57,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:57,459 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:17:57,459 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:57,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1156029018, now seen corresponding path program 1 times [2018-01-24 15:17:57,459 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:57,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:57,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:57,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:57,460 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:57,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:57,562 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 15:17:57,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:17:57,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:17:57,562 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:17:57,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:17:57,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:17:57,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:17:57,563 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2018-01-24 15:17:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:17:57,657 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-24 15:17:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:17:57,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-24 15:17:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:17:57,658 INFO L225 Difference]: With dead ends: 51 [2018-01-24 15:17:57,658 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 15:17:57,659 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:17:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 15:17:57,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-24 15:17:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 15:17:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 15:17:57,665 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-01-24 15:17:57,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:17:57,665 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 15:17:57,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:17:57,665 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 15:17:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 15:17:57,666 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:57,666 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] [2018-01-24 15:17:57,666 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:57,666 INFO L82 PathProgramCache]: Analyzing trace with hash -131455439, now seen corresponding path program 1 times [2018-01-24 15:17:57,667 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:57,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:57,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:57,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:57,668 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:57,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:57,710 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 15:17:57,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:17:57,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:17:57,711 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:17:57,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:17:57,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:17:57,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:17:57,712 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-24 15:17:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:17:57,753 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-01-24 15:17:57,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:17:57,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 15:17:57,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:17:57,754 INFO L225 Difference]: With dead ends: 43 [2018-01-24 15:17:57,754 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 15:17:57,755 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:17:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 15:17:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 15:17:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 15:17:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 15:17:57,761 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-01-24 15:17:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:17:57,761 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 15:17:57,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:17:57,762 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 15:17:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 15:17:57,762 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:57,762 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] [2018-01-24 15:17:57,763 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:57,763 INFO L82 PathProgramCache]: Analyzing trace with hash -131455438, now seen corresponding path program 1 times [2018-01-24 15:17:57,763 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:57,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:57,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:57,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:57,765 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:57,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:57,899 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 15:17:57,899 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:17:57,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:17:57,899 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:17:57,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:17:57,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:17:57,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:17:57,900 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-01-24 15:17:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:17:58,018 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 15:17:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:17:58,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 15:17:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:17:58,019 INFO L225 Difference]: With dead ends: 49 [2018-01-24 15:17:58,019 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 15:17:58,020 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:17:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 15:17:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-01-24 15:17:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 15:17:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 15:17:58,026 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 20 [2018-01-24 15:17:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:17:58,026 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 15:17:58,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:17:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 15:17:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:17:58,027 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:58,028 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] [2018-01-24 15:17:58,028 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash -313436100, now seen corresponding path program 1 times [2018-01-24 15:17:58,028 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:58,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:58,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:58,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:58,030 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:58,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:58,102 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 15:17:58,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:17:58,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:17:58,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:17:58,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:17:58,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:17:58,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:17:58,103 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 15:17:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:17:58,184 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-24 15:17:58,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:17:58,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 15:17:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:17:58,186 INFO L225 Difference]: With dead ends: 44 [2018-01-24 15:17:58,186 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 15:17:58,186 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 15:17:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 15:17:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 15:17:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 15:17:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 15:17:58,191 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-01-24 15:17:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:17:58,191 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 15:17:58,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:17:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 15:17:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:17:58,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:58,193 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] [2018-01-24 15:17:58,193 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash -313436099, now seen corresponding path program 1 times [2018-01-24 15:17:58,193 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:58,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:58,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:58,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:58,194 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:58,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:58,329 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 15:17:58,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:17:58,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:17:58,330 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:17:58,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:17:58,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:17:58,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:17:58,330 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-01-24 15:17:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:17:58,603 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 15:17:58,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:17:58,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 15:17:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:17:58,604 INFO L225 Difference]: With dead ends: 51 [2018-01-24 15:17:58,604 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 15:17:58,604 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 15:17:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 15:17:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-01-24 15:17:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 15:17:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 15:17:58,611 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-01-24 15:17:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:17:58,611 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 15:17:58,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:17:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 15:17:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:17:58,612 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:17:58,612 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] [2018-01-24 15:17:58,612 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:17:58,613 INFO L82 PathProgramCache]: Analyzing trace with hash -313382859, now seen corresponding path program 1 times [2018-01-24 15:17:58,613 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:17:58,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:58,614 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:17:58,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:17:58,614 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:17:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:17:58,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:17:58,732 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 15:17:58,732 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:17:58,732 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:17:58,733 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 15:17:58,734 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [16], [44], [49], [53], [59], [66], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 15:17:58,775 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:17:58,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:18:00,058 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:18:00,060 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 15:18:00,077 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:18:00,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:00,078 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 15:18:00,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:00,088 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:00,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:00,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 15:18:00,200 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 15:18:00,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:00,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:00,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:00,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 15:18:00,265 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 11 [2018-01-24 15:18:00,268 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 15:18:00,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:00,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:00,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:00,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-24 15:18:00,342 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 15:18:00,342 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:00,352 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 15:18:00,372 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 15:18:00,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:00,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:00,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:00,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-24 15:18:00,384 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 15:18:00,420 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:18:00,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 13 [2018-01-24 15:18:00,455 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:00,455 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:18:00,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:18:00,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:18:00,456 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 7 states. [2018-01-24 15:18:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:00,558 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-24 15:18:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:18:00,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-24 15:18:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:00,560 INFO L225 Difference]: With dead ends: 97 [2018-01-24 15:18:00,560 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 15:18:00,561 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-01-24 15:18:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 15:18:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2018-01-24 15:18:00,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 15:18:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-01-24 15:18:00,569 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 24 [2018-01-24 15:18:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:00,570 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-01-24 15:18:00,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:18:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-01-24 15:18:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:18:00,571 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:00,571 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] [2018-01-24 15:18:00,571 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:00,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1334451213, now seen corresponding path program 1 times [2018-01-24 15:18:00,571 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:00,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:00,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:00,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:00,573 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:00,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:00,804 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 15:18:00,805 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:00,805 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:00,805 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 15:18:00,805 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [16], [44], [49], [53], [61], [66], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 15:18:00,806 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:18:00,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:18:01,686 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:18:01,686 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 15:18:01,699 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:18:01,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:01,699 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 15:18:01,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:01,706 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:01,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:01,753 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 15:18:01,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:01,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:01,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-24 15:18:02,149 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 15:18:02,149 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:02,306 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 15:18:02,326 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:02,327 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 15:18:02,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:02,342 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:02,373 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:02,426 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 15:18:02,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:02,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:02,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:18:02,527 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 15:18:02,527 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:02,563 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 15:18:02,565 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:02,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8, 7, 8] total 24 [2018-01-24 15:18:02,565 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:02,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:18:02,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:18:02,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-01-24 15:18:02,566 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 13 states. [2018-01-24 15:18:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:02,763 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-01-24 15:18:02,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:18:02,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-01-24 15:18:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:02,766 INFO L225 Difference]: With dead ends: 79 [2018-01-24 15:18:02,766 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 15:18:02,767 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2018-01-24 15:18:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 15:18:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2018-01-24 15:18:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 15:18:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-24 15:18:02,774 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2018-01-24 15:18:02,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:02,775 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-24 15:18:02,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:18:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-24 15:18:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 15:18:02,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:02,776 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] [2018-01-24 15:18:02,776 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1126584510, now seen corresponding path program 1 times [2018-01-24 15:18:02,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:02,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:02,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:02,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:02,778 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:02,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:02,837 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 15:18:02,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:02,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:18:02,837 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:02,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:18:02,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:18:02,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:18:02,838 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2018-01-24 15:18:02,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:02,919 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-24 15:18:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:18:02,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 15:18:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:02,921 INFO L225 Difference]: With dead ends: 62 [2018-01-24 15:18:02,921 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 15:18:02,921 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 15:18:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 15:18:02,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 15:18:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 15:18:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-01-24 15:18:02,932 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2018-01-24 15:18:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:02,932 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-01-24 15:18:02,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:18:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-01-24 15:18:02,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 15:18:02,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:02,933 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] [2018-01-24 15:18:02,934 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:02,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1126584509, now seen corresponding path program 1 times [2018-01-24 15:18:02,934 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:02,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:02,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:02,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:02,935 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:02,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:03,063 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 15:18:03,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:03,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:18:03,064 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:03,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:18:03,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:18:03,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:18:03,065 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 8 states. [2018-01-24 15:18:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:03,257 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-01-24 15:18:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:18:03,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 15:18:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:03,258 INFO L225 Difference]: With dead ends: 67 [2018-01-24 15:18:03,258 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 15:18:03,258 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:18:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 15:18:03,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-01-24 15:18:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 15:18:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-01-24 15:18:03,266 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 25 [2018-01-24 15:18:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:03,266 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-01-24 15:18:03,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:18:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-01-24 15:18:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:18:03,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:03,267 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:03,267 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:03,268 INFO L82 PathProgramCache]: Analyzing trace with hash -99148426, now seen corresponding path program 2 times [2018-01-24 15:18:03,268 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:03,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:03,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:03,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:03,269 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:03,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 15:18:03,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:03,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 15:18:03,405 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:03,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 15:18:03,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 15:18:03,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:18:03,406 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 12 states. [2018-01-24 15:18:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:03,676 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2018-01-24 15:18:03,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 15:18:03,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-01-24 15:18:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:03,677 INFO L225 Difference]: With dead ends: 132 [2018-01-24 15:18:03,677 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 15:18:03,678 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-01-24 15:18:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 15:18:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2018-01-24 15:18:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 15:18:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-01-24 15:18:03,685 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 28 [2018-01-24 15:18:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:03,686 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-01-24 15:18:03,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 15:18:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-01-24 15:18:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:18:03,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:03,687 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:03,687 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:03,688 INFO L82 PathProgramCache]: Analyzing trace with hash 323553400, now seen corresponding path program 1 times [2018-01-24 15:18:03,688 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:03,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:03,689 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:18:03,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:03,689 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:03,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:04,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:04,150 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:04,150 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 15:18:04,151 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [16], [44], [49], [55], [61], [66], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 15:18:04,152 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:18:04,152 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:18:04,971 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:18:04,972 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 15:18:04,990 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:18:04,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:04,990 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 15:18:05,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:05,011 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:05,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:05,040 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 15:18:05,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:05,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:05,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 15:18:05,123 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 15:18:05,126 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 15:18:05,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:05,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:05,137 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 15:18:05,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 15:18:05,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 15:18:05,292 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 14 treesize of output 11 [2018-01-24 15:18:05,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:05,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:05,313 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 15:18:05,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-01-24 15:18:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:05,472 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:05,700 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 15:18:05,709 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 15:18:05,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:05,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:05,718 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 15:18:05,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:38 [2018-01-24 15:18:05,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:05,950 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:05,950 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 15:18:05,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:05,953 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:05,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:06,001 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 15:18:06,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:06,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:06,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 15:18:06,044 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 15:18:06,046 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 15:18:06,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:06,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:06,062 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 15:18:06,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 15:18:06,160 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 17 treesize of output 13 [2018-01-24 15:18:06,166 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 13 treesize of output 14 [2018-01-24 15:18:06,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:06,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:06,184 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 15:18:06,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:40 [2018-01-24 15:18:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:06,239 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:06,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 15:18:06,420 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 15:18:06,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:06,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:06,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:06,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:16 [2018-01-24 15:18:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:06,577 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:06,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 14] total 46 [2018-01-24 15:18:06,577 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:06,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 15:18:06,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 15:18:06,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1974, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 15:18:06,578 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 22 states. [2018-01-24 15:18:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:07,333 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-01-24 15:18:07,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 15:18:07,333 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-01-24 15:18:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:07,334 INFO L225 Difference]: With dead ends: 88 [2018-01-24 15:18:07,334 INFO L226 Difference]: Without dead ends: 87 [2018-01-24 15:18:07,335 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 70 SyntacticMatches, 9 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=355, Invalid=2837, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 15:18:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-24 15:18:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-01-24 15:18:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 15:18:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-01-24 15:18:07,345 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 28 [2018-01-24 15:18:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:07,346 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-01-24 15:18:07,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 15:18:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-01-24 15:18:07,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:18:07,347 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:07,348 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:07,348 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1309566295, now seen corresponding path program 1 times [2018-01-24 15:18:07,348 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:07,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:07,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:07,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:07,350 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:07,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:07,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:07,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 15:18:07,590 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:07,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 15:18:07,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 15:18:07,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-24 15:18:07,591 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 15 states. [2018-01-24 15:18:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:08,056 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2018-01-24 15:18:08,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 15:18:08,056 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-01-24 15:18:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:08,057 INFO L225 Difference]: With dead ends: 178 [2018-01-24 15:18:08,057 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 15:18:08,058 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 15:18:08,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 15:18:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2018-01-24 15:18:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 15:18:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2018-01-24 15:18:08,069 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 29 [2018-01-24 15:18:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:08,070 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2018-01-24 15:18:08,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 15:18:08,070 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2018-01-24 15:18:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:18:08,070 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:08,071 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:08,071 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1528421013, now seen corresponding path program 1 times [2018-01-24 15:18:08,071 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:08,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:08,072 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:08,072 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:08,072 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:08,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:08,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:08,335 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:08,335 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:18:08,336 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [12], [22], [24], [25], [27], [28], [35], [44], [49], [55], [59], [66], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 15:18:08,336 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:18:08,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:18:13,103 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:18:13,104 INFO L268 AbstractInterpreter]: Visited 27 different actions 50 times. Merged at 6 different actions 23 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-01-24 15:18:13,106 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:18:13,106 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:13,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 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 15:18:13,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:13,111 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:13,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:13,132 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 15:18:13,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:18:13,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:13,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:13,161 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 15:18:13,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 15:18:13,190 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 15:18:13,193 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 15:18:13,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,199 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 15:18:13,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 15:18:13,221 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 15:18:13,222 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 15:18:13,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,232 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 15:18:13,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 15:18:13,414 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 15:18:13,420 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 15:18:13,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:13,427 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 15:18:13,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:13,440 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 15:18:13,440 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-24 15:18:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:13,477 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:13,703 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 15:18:13,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,709 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 15:18:13,717 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 15:18:13,718 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,723 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 15:18:13,723 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-24 15:18:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:13,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:13,772 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 15:18:13,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:13,775 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:13,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:13,837 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 15:18:13,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,842 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 15:18:13,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:18:13,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:13,893 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 15:18:13,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:13,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:13,901 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 15:18:13,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:18:13,954 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 15:18:13,956 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 15:18:13,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:13,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-24 15:18:14,008 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 27 treesize of output 28 [2018-01-24 15:18:14,010 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 15:18:14,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:14,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:14,020 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 15:18:14,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-01-24 15:18:14,194 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 29 treesize of output 27 [2018-01-24 15:18:14,199 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 15:18:14,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:14,205 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 15:18:14,206 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:14,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:14,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:14,214 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:30 [2018-01-24 15:18:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:14,318 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:14,548 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 15:18:14,556 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 15:18:14,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:14,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:14,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:14,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 15:18:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:14,738 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:14,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 10, 13, 11] total 50 [2018-01-24 15:18:14,739 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:14,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 15:18:14,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 15:18:14,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2370, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 15:18:14,740 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand 24 states. [2018-01-24 15:18:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:15,959 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2018-01-24 15:18:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 15:18:15,959 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-01-24 15:18:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:15,961 INFO L225 Difference]: With dead ends: 145 [2018-01-24 15:18:15,961 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 15:18:15,962 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=323, Invalid=3459, Unknown=0, NotChecked=0, Total=3782 [2018-01-24 15:18:15,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 15:18:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-01-24 15:18:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 15:18:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-01-24 15:18:15,977 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 29 [2018-01-24 15:18:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:15,977 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-01-24 15:18:15,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 15:18:15,978 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-01-24 15:18:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:18:15,978 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:15,979 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:15,979 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:15,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1438570336, now seen corresponding path program 1 times [2018-01-24 15:18:15,979 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:15,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:15,980 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:15,980 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:15,980 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:15,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:16,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:16,082 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:16,082 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:18:16,083 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [12], [14], [16], [22], [24], [25], [30], [44], [49], [55], [61], [66], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 15:18:16,084 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:18:16,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:18:16,611 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:18:16,611 INFO L268 AbstractInterpreter]: Visited 27 different actions 36 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-24 15:18:16,612 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:18:16,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:16,612 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 15:18:16,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:16,617 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:16,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:16,642 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 15:18:16,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:16,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:16,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-24 15:18:16,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:16,721 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:16,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:16,851 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 15:18:16,855 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:16,855 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:16,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:16,897 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 15:18:16,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:16,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:16,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-24 15:18:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:16,970 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:17,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:17,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9, 8, 9] total 31 [2018-01-24 15:18:17,066 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:17,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 15:18:17,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 15:18:17,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2018-01-24 15:18:17,067 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 17 states. [2018-01-24 15:18:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:17,336 INFO L93 Difference]: Finished difference Result 154 states and 178 transitions. [2018-01-24 15:18:17,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 15:18:17,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-01-24 15:18:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:17,337 INFO L225 Difference]: With dead ends: 154 [2018-01-24 15:18:17,337 INFO L226 Difference]: Without dead ends: 153 [2018-01-24 15:18:17,338 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2018-01-24 15:18:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-24 15:18:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2018-01-24 15:18:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-24 15:18:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 159 transitions. [2018-01-24 15:18:17,350 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 159 transitions. Word has length 29 [2018-01-24 15:18:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:17,350 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 159 transitions. [2018-01-24 15:18:17,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 15:18:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 159 transitions. [2018-01-24 15:18:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 15:18:17,351 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:17,351 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:17,351 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1106610309, now seen corresponding path program 2 times [2018-01-24 15:18:17,352 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:17,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:17,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:17,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:17,353 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:17,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:17,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:17,776 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:17,776 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:18:17,776 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:18:17,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:17,776 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 15:18:17,781 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:18:17,781 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:18:17,791 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:17,796 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:17,802 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:18:17,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:17,851 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 15:18:17,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:17,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:17,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 15:18:17,888 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 15:18:17,890 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 15:18:17,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:17,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:17,896 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 15:18:17,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 15:18:18,068 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 25 treesize of output 19 [2018-01-24 15:18:18,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:18,075 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 19 treesize of output 25 [2018-01-24 15:18:18,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:18,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:18,098 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 15:18:18,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:58 [2018-01-24 15:18:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:18,213 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:18,513 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 36 treesize of output 32 [2018-01-24 15:18:18,531 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:18:18,532 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:18:18,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:18,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:18,538 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 34 treesize of output 30 [2018-01-24 15:18:18,555 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:18:18,556 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:18:18,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:18,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:18,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:18,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:71, output treesize:27 [2018-01-24 15:18:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:18,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:18,729 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 15:18:18,732 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:18:18,732 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:18:18,747 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:18,768 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:18,798 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:18:18,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:18,806 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 15:18:18,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:18,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:18,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 15:18:18,815 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 15:18:18,816 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 15:18:18,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:18,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:18,822 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 15:18:18,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 15:18:18,830 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 25 treesize of output 19 [2018-01-24 15:18:18,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:18,839 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 19 treesize of output 25 [2018-01-24 15:18:18,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:18,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:18,865 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 15:18:18,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:58 [2018-01-24 15:18:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:18,871 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:19,106 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 15:18:19,120 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:18:19,121 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 15:18:19,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:19,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:19,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:19,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:19 [2018-01-24 15:18:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:19,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:19,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16, 16, 16] total 57 [2018-01-24 15:18:19,351 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:19,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-24 15:18:19,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-24 15:18:19,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2989, Unknown=0, NotChecked=0, Total=3306 [2018-01-24 15:18:19,353 INFO L87 Difference]: Start difference. First operand 141 states and 159 transitions. Second operand 34 states. [2018-01-24 15:18:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:20,455 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2018-01-24 15:18:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 15:18:20,455 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32 [2018-01-24 15:18:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:20,457 INFO L225 Difference]: With dead ends: 190 [2018-01-24 15:18:20,457 INFO L226 Difference]: Without dead ends: 189 [2018-01-24 15:18:20,459 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=600, Invalid=4656, Unknown=0, NotChecked=0, Total=5256 [2018-01-24 15:18:20,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-24 15:18:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2018-01-24 15:18:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 15:18:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-01-24 15:18:20,474 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 32 [2018-01-24 15:18:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:20,474 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-01-24 15:18:20,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-24 15:18:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-01-24 15:18:20,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:18:20,475 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:20,475 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:20,475 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1452172801, now seen corresponding path program 2 times [2018-01-24 15:18:20,475 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:20,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:20,476 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:18:20,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:20,476 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:20,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:20,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:20,817 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:20,818 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:18:20,818 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:18:20,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:20,818 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:18:20,823 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:18:20,823 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:18:20,835 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:20,840 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:20,843 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:18:20,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:20,848 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 15:18:20,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,854 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 15:18:20,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:18:20,876 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:20,877 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 15:18:20,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:20,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:20,887 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 15:18:20,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,893 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:18:20,927 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 15:18:20,928 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 15:18:20,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-01-24 15:18:20,956 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 27 treesize of output 28 [2018-01-24 15:18:20,958 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 15:18:20,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:20,967 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 15:18:20,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-01-24 15:18:21,115 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 33 treesize of output 32 [2018-01-24 15:18:21,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-24 15:18:21,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:21,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:21,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 15:18:21,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:43, output treesize:51 [2018-01-24 15:18:21,228 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 15:18:21,239 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 15:18:21,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:21,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:21,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:21,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2018-01-24 15:18:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:21,402 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:22,041 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 37 treesize of output 28 [2018-01-24 15:18:22,053 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 15:18:22,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 15:18:22,067 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 9 treesize of output 1 [2018-01-24 15:18:22,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,070 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,071 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 19 treesize of output 15 [2018-01-24 15:18:22,073 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 15:18:22,073 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,074 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:18:22,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 15:18:22,103 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:68, output treesize:166 [2018-01-24 15:18:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:22,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:22,351 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 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 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:18:22,354 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:18:22,354 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:18:22,370 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:22,396 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:18:22,438 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:18:22,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:22,446 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 15:18:22,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,458 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 15:18:22,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:18:22,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:22,466 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 15:18:22,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:22,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:22,474 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 15:18:22,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:18:22,482 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 15:18:22,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 15:18:22,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 15:18:22,525 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 26 treesize of output 27 [2018-01-24 15:18:22,527 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 15:18:22,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:22,534 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 15:18:22,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-24 15:18:22,748 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 33 treesize of output 32 [2018-01-24 15:18:22,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-24 15:18:22,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:22,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:22,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 15:18:22,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-01-24 15:18:22,880 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 15:18:22,886 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 15:18:22,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:22,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:22,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:22,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 15:18:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:22,947 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:23,518 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 37 treesize of output 28 [2018-01-24 15:18:23,533 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 15:18:23,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:23,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-01-24 15:18:23,572 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 9 treesize of output 1 [2018-01-24 15:18:23,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:23,574 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:23,576 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 19 treesize of output 15 [2018-01-24 15:18:23,578 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 15:18:23,578 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:23,579 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:23,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:18:23,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:18:23,608 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-24 15:18:24,149 WARN L146 SmtUtils]: Spent 338ms on a formula simplification. DAG size of input: 37 DAG size of output 34 [2018-01-24 15:18:24,525 WARN L143 SmtUtils]: Spent 318ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 15:18:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:24,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:24,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15, 16, 15] total 62 [2018-01-24 15:18:24,536 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:24,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 15:18:24,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 15:18:24,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=3654, Unknown=0, NotChecked=0, Total=3906 [2018-01-24 15:18:24,538 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 30 states. [2018-01-24 15:18:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:25,303 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2018-01-24 15:18:25,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 15:18:25,303 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-01-24 15:18:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:25,304 INFO L225 Difference]: With dead ends: 162 [2018-01-24 15:18:25,304 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 15:18:25,306 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 83 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2018-01-24 15:18:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 15:18:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2018-01-24 15:18:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-24 15:18:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2018-01-24 15:18:25,321 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 34 [2018-01-24 15:18:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:25,321 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2018-01-24 15:18:25,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 15:18:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2018-01-24 15:18:25,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 15:18:25,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:25,322 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:25,322 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:25,322 INFO L82 PathProgramCache]: Analyzing trace with hash 357476204, now seen corresponding path program 1 times [2018-01-24 15:18:25,322 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:25,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:25,323 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:18:25,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:25,323 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:25,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:25,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:25,815 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:25,815 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-24 15:18:25,816 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [12], [14], [16], [22], [24], [25], [28], [30], [35], [44], [49], [55], [61], [66], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 15:18:25,817 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:18:25,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:18:33,049 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:18:33,050 INFO L268 AbstractInterpreter]: Visited 29 different actions 74 times. Merged at 11 different actions 44 times. Widened at 1 different actions 3 times. Found 3 fixpoints after 2 different actions. Largest state had 28 variables. [2018-01-24 15:18:33,051 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:18:33,051 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:33,052 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:18:33,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:33,057 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:33,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:33,081 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 15:18:33,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,091 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 15:18:33,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-24 15:18:33,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:33,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:33,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 15:18:33,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:33,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:33,155 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 15:18:33,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-24 15:18:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:33,357 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:33,720 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 10 treesize of output 3 [2018-01-24 15:18:33,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,781 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 15:18:33,791 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 15:18:33,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,792 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 12 treesize of output 3 [2018-01-24 15:18:33,792 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 15:18:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:33,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:33,845 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 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 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:18:33,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:33,848 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:18:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:33,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:33,894 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 15:18:33,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,901 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 15:18:33,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-01-24 15:18:33,975 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:33,976 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:33,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 15:18:33,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,990 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:33,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:33,992 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 15:18:33,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:33,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-01-24 15:18:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:34,127 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:34,517 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 10 treesize of output 3 [2018-01-24 15:18:34,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:34,522 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-24 15:18:34,529 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 15:18:34,529 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:34,531 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 12 treesize of output 3 [2018-01-24 15:18:34,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:34,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:34,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:34,537 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:24, output treesize:7 [2018-01-24 15:18:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:34,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:34,594 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 13, 14] total 53 [2018-01-24 15:18:34,594 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:34,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 15:18:34,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 15:18:34,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2655, Unknown=0, NotChecked=0, Total=2862 [2018-01-24 15:18:34,596 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 28 states. [2018-01-24 15:18:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:35,434 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2018-01-24 15:18:35,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 15:18:35,434 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-01-24 15:18:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:35,435 INFO L225 Difference]: With dead ends: 200 [2018-01-24 15:18:35,435 INFO L226 Difference]: Without dead ends: 199 [2018-01-24 15:18:35,436 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=503, Invalid=4753, Unknown=0, NotChecked=0, Total=5256 [2018-01-24 15:18:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-24 15:18:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2018-01-24 15:18:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-24 15:18:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2018-01-24 15:18:35,451 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 34 [2018-01-24 15:18:35,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:35,451 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2018-01-24 15:18:35,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 15:18:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2018-01-24 15:18:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 15:18:35,452 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:35,452 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, 1, 1, 1] [2018-01-24 15:18:35,452 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:35,453 INFO L82 PathProgramCache]: Analyzing trace with hash -679902947, now seen corresponding path program 1 times [2018-01-24 15:18:35,453 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:35,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:35,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:35,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:35,454 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:35,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:35,534 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 15:18:35,534 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:18:35,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:18:35,534 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:18:35,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:18:35,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:18:35,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:18:35,534 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand 6 states. [2018-01-24 15:18:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:18:35,610 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2018-01-24 15:18:35,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:18:35,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 15:18:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:18:35,611 INFO L225 Difference]: With dead ends: 163 [2018-01-24 15:18:35,611 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 15:18:35,612 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 15:18:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 15:18:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-01-24 15:18:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-24 15:18:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-01-24 15:18:35,622 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 35 [2018-01-24 15:18:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:18:35,622 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-01-24 15:18:35,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:18:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-01-24 15:18:35,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 15:18:35,622 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:18:35,622 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:18:35,623 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 15:18:35,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1017556222, now seen corresponding path program 3 times [2018-01-24 15:18:35,623 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:18:35,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:35,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:18:35,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:18:35,623 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:18:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:18:35,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:18:36,075 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:36,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:36,075 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:18:36,076 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:18:36,076 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:18:36,076 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:36,076 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:18:36,085 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:18:36,085 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:18:36,096 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:18:36,099 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:18:36,101 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:18:36,104 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:18:36,106 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:18:36,108 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:18:36,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:36,114 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 15:18:36,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:36,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:36,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 15:18:36,150 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 15:18:36,153 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 15:18:36,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:36,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:36,160 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 15:18:36,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 15:18:36,517 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 33 treesize of output 25 [2018-01-24 15:18:36,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 55 [2018-01-24 15:18:36,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-01-24 15:18:36,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:36,583 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 15:18:36,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:61 [2018-01-24 15:18:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:36,747 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:37,313 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 40 treesize of output 34 [2018-01-24 15:18:37,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2018-01-24 15:18:37,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:37,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:37,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:37,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:90 [2018-01-24 15:18:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:37,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:18:37,618 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 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 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:18:37,621 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 15:18:37,621 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 15:18:37,634 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:18:37,654 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:18:37,693 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:18:37,723 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:18:37,757 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 15:18:37,829 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:18:37,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:18:37,839 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 15:18:37,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:37,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:37,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 15:18:37,855 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 15:18:37,857 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 15:18:37,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:37,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:37,863 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 15:18:37,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 15:18:38,041 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 33 treesize of output 25 [2018-01-24 15:18:38,043 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:38,044 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:18:38,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 39 [2018-01-24 15:18:38,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:18:38,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:18:38,077 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 15:18:38,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:76 [2018-01-24 15:18:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:38,229 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:18:38,715 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 44 treesize of output 38 [2018-01-24 15:18:38,734 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:18:38,768 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:18:38,769 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 15:18:38,771 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-01-24 15:18:38,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:18:38,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:38,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:18:38,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:22 [2018-01-24 15:18:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:18:39,016 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:18:39,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20, 19, 19] total 76 [2018-01-24 15:18:39,017 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:18:39,017 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-24 15:18:39,017 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-24 15:18:39,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=5322, Unknown=0, NotChecked=0, Total=5852 [2018-01-24 15:18:39,019 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 35 states. Received shutdown request... [2018-01-24 15:18:39,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 15:18:39,436 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:18:39,439 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:18:39,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:18:39 BoogieIcfgContainer [2018-01-24 15:18:39,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:18:39,440 INFO L168 Benchmark]: Toolchain (without parser) took 43744.77 ms. Allocated memory was 297.3 MB in the beginning and 1.2 GB in the end (delta: 903.9 MB). Free memory was 257.3 MB in the beginning and 695.7 MB in the end (delta: -438.4 MB). Peak memory consumption was 465.5 MB. Max. memory is 5.3 GB. [2018-01-24 15:18:39,440 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:18:39,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.41 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 246.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:18:39,441 INFO L168 Benchmark]: Boogie Preprocessor took 34.82 ms. Allocated memory is still 297.3 MB. Free memory was 246.1 MB in the beginning and 244.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:18:39,441 INFO L168 Benchmark]: RCFGBuilder took 245.25 ms. Allocated memory is still 297.3 MB. Free memory was 244.1 MB in the beginning and 225.6 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:18:39,441 INFO L168 Benchmark]: TraceAbstraction took 43233.45 ms. Allocated memory was 297.3 MB in the beginning and 1.2 GB in the end (delta: 903.9 MB). Free memory was 225.6 MB in the beginning and 695.7 MB in the end (delta: -470.1 MB). Peak memory consumption was 433.8 MB. Max. memory is 5.3 GB. [2018-01-24 15:18:39,442 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.21 ms. Allocated memory is still 297.3 MB. Free memory is still 263.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.41 ms. Allocated memory is still 297.3 MB. Free memory was 256.3 MB in the beginning and 246.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.82 ms. Allocated memory is still 297.3 MB. Free memory was 246.1 MB in the beginning and 244.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 245.25 ms. Allocated memory is still 297.3 MB. Free memory was 244.1 MB in the beginning and 225.6 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 43233.45 ms. Allocated memory was 297.3 MB in the beginning and 1.2 GB in the end (delta: 903.9 MB). Free memory was 225.6 MB in the beginning and 695.7 MB in the end (delta: -470.1 MB). Peak memory consumption was 433.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 263 LocStat_NO_SUPPORTING_DISEQUALITIES : 55 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.754135 RENAME_VARIABLES(MILLISECONDS) : 0.313922 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.693931 PROJECTAWAY(MILLISECONDS) : 0.421064 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.097624 DISJOIN(MILLISECONDS) : 0.386465 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.350001 ADD_EQUALITY(MILLISECONDS) : 0.023077 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014021 #CONJOIN_DISJUNCTIVE : 51 #RENAME_VARIABLES : 76 #UNFREEZE : 0 #CONJOIN : 96 #PROJECTAWAY : 69 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 73 #ADD_EQUALITY : 59 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 269 LocStat_NO_SUPPORTING_DISEQUALITIES : 55 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.043667 RENAME_VARIABLES(MILLISECONDS) : 0.173587 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.006493 PROJECTAWAY(MILLISECONDS) : 0.259616 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.117096 DISJOIN(MILLISECONDS) : 0.325707 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.193764 ADD_EQUALITY(MILLISECONDS) : 0.017850 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011599 #CONJOIN_DISJUNCTIVE : 50 #RENAME_VARIABLES : 76 #UNFREEZE : 0 #CONJOIN : 95 #PROJECTAWAY : 69 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 73 #ADD_EQUALITY : 59 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 256 LocStat_NO_SUPPORTING_DISEQUALITIES : 41 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.564726 RENAME_VARIABLES(MILLISECONDS) : 0.358789 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.512814 PROJECTAWAY(MILLISECONDS) : 0.410770 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.077733 DISJOIN(MILLISECONDS) : 0.489295 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.388561 ADD_EQUALITY(MILLISECONDS) : 0.018903 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008932 #CONJOIN_DISJUNCTIVE : 49 #RENAME_VARIABLES : 76 #UNFREEZE : 0 #CONJOIN : 94 #PROJECTAWAY : 69 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 73 #ADD_EQUALITY : 59 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 359 LocStat_NO_SUPPORTING_DISEQUALITIES : 50 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 11.576272 RENAME_VARIABLES(MILLISECONDS) : 1.708874 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 11.520434 PROJECTAWAY(MILLISECONDS) : 13.873468 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.060270 DISJOIN(MILLISECONDS) : 2.050294 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.746710 ADD_EQUALITY(MILLISECONDS) : 0.028173 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013436 #CONJOIN_DISJUNCTIVE : 92 #RENAME_VARIABLES : 162 #UNFREEZE : 0 #CONJOIN : 154 #PROJECTAWAY : 119 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 28 #RENAME_VARIABLES_DISJUNCTIVE : 153 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 345 LocStat_NO_SUPPORTING_DISEQUALITIES : 53 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.532757 RENAME_VARIABLES(MILLISECONDS) : 0.233696 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.764225 PROJECTAWAY(MILLISECONDS) : 0.053705 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.063376 DISJOIN(MILLISECONDS) : 0.333693 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.262223 ADD_EQUALITY(MILLISECONDS) : 0.012067 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012410 #CONJOIN_DISJUNCTIVE : 63 #RENAME_VARIABLES : 100 #UNFREEZE : 0 #CONJOIN : 116 #PROJECTAWAY : 85 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 97 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 5 LocStat_NO_SUPPORTING_EQUALITIES : 359 LocStat_NO_SUPPORTING_DISEQUALITIES : 56 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 36 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 14.914516 RENAME_VARIABLES(MILLISECONDS) : 1.622614 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 7.377173 PROJECTAWAY(MILLISECONDS) : 0.098742 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.035185 DISJOIN(MILLISECONDS) : 1.846181 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.643546 ADD_EQUALITY(MILLISECONDS) : 0.010309 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.007223 #CONJOIN_DISJUNCTIVE : 128 #RENAME_VARIABLES : 238 #UNFREEZE : 0 #CONJOIN : 194 #PROJECTAWAY : 161 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 43 #RENAME_VARIABLES_DISJUNCTIVE : 225 #ADD_EQUALITY : 73 #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 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 12 states, 35 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 34. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 11 error locations. TIMEOUT Result, 43.1s OverallTime, 24 OverallIterations, 5 TraceHistogramMax, 7.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 861 SDtfs, 1631 SDslu, 4839 SDs, 0 SdLazy, 4106 SolverSat, 411 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1385 GetRequests, 708 SyntacticMatches, 45 SemanticMatches, 631 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9813 ImplicationChecksByTransitivity, 18.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 15.6s AbstIntTime, 6 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 230 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 1105 NumberOfCodeBlocks, 1105 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 1563 ConstructedInterpolants, 140 QuantifiedInterpolants, 533157 SizeOfPredicates, 259 NumberOfNonLiveVariables, 2472 ConjunctsInSsa, 678 ConjunctsInUnsatCore, 58 InterpolantComputations, 17 PerfectInterpolantSequences, 15/437 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_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-24_15-18-39-454.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-18-39-454.csv Completed graceful shutdown