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_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:28:52,633 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:28:52,635 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:28:52,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:28:52,649 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:28:52,650 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:28:52,651 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:28:52,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:28:52,654 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:28:52,654 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:28:52,655 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:28:52,655 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:28:52,656 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:28:52,658 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:28:52,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:28:52,661 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:28:52,663 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:28:52,665 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:28:52,666 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:28:52,667 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:28:52,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:28:52,669 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:28:52,669 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:28:52,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:28:52,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:28:52,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:28:52,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:28:52,673 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:28:52,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:28:52,674 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:28:52,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:28:52,674 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_smtcomp.epf [2018-01-25 05:28:52,684 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:28:52,684 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:28:52,685 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:28:52,685 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:28:52,685 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:28:52,685 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:28:52,686 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:28:52,686 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:28:52,687 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:28:52,687 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:28:52,687 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:28:52,687 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:28:52,687 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:28:52,687 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:28:52,688 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:28:52,688 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:28:52,688 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:28:52,688 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:28:52,688 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:28:52,689 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:28:52,689 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:28:52,689 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:28:52,689 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:28:52,689 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:28:52,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:28:52,690 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:28:52,690 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:28:52,690 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:28:52,690 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:28:52,690 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:28:52,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:28:52,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:28:52,691 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:28:52,691 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:28:52,692 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:28:52,692 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:28:52,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:28:52,737 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:28:52,740 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:28:52,741 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:28:52,742 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:28:52,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:28:52,911 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:28:52,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:28:52,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:28:52,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:28:52,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:28:52,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:28:52" (1/1) ... [2018-01-25 05:28:52,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdf0e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:52, skipping insertion in model container [2018-01-25 05:28:52,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:28:52" (1/1) ... [2018-01-25 05:28:52,940 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:28:52,976 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:28:53,089 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:28:53,104 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:28:53,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:53 WrapperNode [2018-01-25 05:28:53,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:28:53,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:28:53,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:28:53,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:28:53,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:53" (1/1) ... [2018-01-25 05:28:53,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:53" (1/1) ... [2018-01-25 05:28:53,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:53" (1/1) ... [2018-01-25 05:28:53,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:53" (1/1) ... [2018-01-25 05:28:53,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:53" (1/1) ... [2018-01-25 05:28:53,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:53" (1/1) ... [2018-01-25 05:28:53,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:53" (1/1) ... [2018-01-25 05:28:53,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:28:53,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:28:53,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:28:53,141 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:28:53,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:53" (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-25 05:28:53,188 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:28:53,189 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:28:53,189 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-25 05:28:53,189 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:28:53,189 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:28:53,189 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:28:53,189 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:28:53,189 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:28:53,189 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:28:53,189 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:28:53,190 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-25 05:28:53,190 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:28:53,190 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:28:53,190 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:28:53,409 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:28:53,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:28:53 BoogieIcfgContainer [2018-01-25 05:28:53,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:28:53,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:28:53,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:28:53,412 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:28:53,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:28:52" (1/3) ... [2018-01-25 05:28:53,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189240df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:28:53, skipping insertion in model container [2018-01-25 05:28:53,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:28:53" (2/3) ... [2018-01-25 05:28:53,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189240df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:28:53, skipping insertion in model container [2018-01-25 05:28:53,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:28:53" (3/3) ... [2018-01-25 05:28:53,415 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:28:53,423 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:28:53,428 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 05:28:53,465 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:28:53,466 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:28:53,492 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:28:53,492 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:28:53,492 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:28:53,492 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:28:53,492 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:28:53,492 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:28:53,493 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:28:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-25 05:28:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:28:53,521 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:53,522 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:53,522 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash -417514722, now seen corresponding path program 1 times [2018-01-25 05:28:53,529 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:53,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:53,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:53,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:53,570 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:53,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:53,740 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-25 05:28:53,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:53,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:28:53,743 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:53,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:28:53,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:28:53,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:28:53,763 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-25 05:28:53,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:53,948 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-01-25 05:28:53,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:28:53,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:28:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:53,959 INFO L225 Difference]: With dead ends: 71 [2018-01-25 05:28:53,959 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:28:53,962 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-25 05:28:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:28:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 05:28:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:28:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-25 05:28:53,995 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-25 05:28:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:53,995 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-25 05:28:53,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:28:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-25 05:28:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:28:53,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:53,996 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:53,996 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash -417514721, now seen corresponding path program 1 times [2018-01-25 05:28:53,997 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:53,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:53,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:53,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:53,999 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:54,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:54,187 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-25 05:28:54,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:54,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:28:54,188 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:54,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:54,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:54,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:54,190 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-25 05:28:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:54,276 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-25 05:28:54,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:54,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 05:28:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:54,278 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:28:54,278 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 05:28:54,279 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:28:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 05:28:54,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 05:28:54,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 05:28:54,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-25 05:28:54,287 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-25 05:28:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:54,288 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-25 05:28:54,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-25 05:28:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:28:54,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:54,289 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:54,289 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:54,289 INFO L82 PathProgramCache]: Analyzing trace with hash -58054499, now seen corresponding path program 1 times [2018-01-25 05:28:54,289 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:54,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:54,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:54,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:54,290 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:54,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:54,347 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-25 05:28:54,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:54,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:28:54,347 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:54,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:28:54,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:28:54,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:28:54,348 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-25 05:28:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:54,412 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-25 05:28:54,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:28:54,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:28:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:54,414 INFO L225 Difference]: With dead ends: 53 [2018-01-25 05:28:54,414 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 05:28:54,415 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-25 05:28:54,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 05:28:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 05:28:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:28:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-25 05:28:54,422 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-25 05:28:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:54,422 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-25 05:28:54,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:28:54,423 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-25 05:28:54,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:28:54,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:54,423 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:54,424 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:54,424 INFO L82 PathProgramCache]: Analyzing trace with hash -58054498, now seen corresponding path program 1 times [2018-01-25 05:28:54,424 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:54,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:54,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:54,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:54,425 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:54,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:54,509 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-25 05:28:54,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:54,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:28:54,510 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:54,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:28:54,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:28:54,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:28:54,510 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-25 05:28:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:54,573 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-25 05:28:54,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:54,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:28:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:54,574 INFO L225 Difference]: With dead ends: 52 [2018-01-25 05:28:54,574 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:28:54,574 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:28:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 05:28:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:28:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-25 05:28:54,579 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-25 05:28:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:54,579 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-25 05:28:54,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:28:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-25 05:28:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:28:54,580 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:54,580 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-25 05:28:54,580 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356832, now seen corresponding path program 1 times [2018-01-25 05:28:54,580 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:54,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:54,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:54,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:54,582 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:54,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:54,716 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-25 05:28:54,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:54,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:28:54,716 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:54,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:28:54,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:28:54,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:28:54,718 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 8 states. [2018-01-25 05:28:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:54,838 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-01-25 05:28:54,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:28:54,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-25 05:28:54,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:54,841 INFO L225 Difference]: With dead ends: 70 [2018-01-25 05:28:54,841 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 05:28:54,841 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:28:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 05:28:54,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-01-25 05:28:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 05:28:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-01-25 05:28:54,846 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 20 [2018-01-25 05:28:54,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:54,846 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-01-25 05:28:54,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:28:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-01-25 05:28:54,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 05:28:54,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:54,847 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-25 05:28:54,847 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:54,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356831, now seen corresponding path program 1 times [2018-01-25 05:28:54,847 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:54,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:54,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:54,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:54,848 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:54,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:54,900 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-25 05:28:54,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:54,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:28:54,901 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:54,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:28:54,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:28:54,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:28:54,902 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 5 states. [2018-01-25 05:28:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:54,948 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-01-25 05:28:54,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:28:54,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 05:28:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:54,949 INFO L225 Difference]: With dead ends: 57 [2018-01-25 05:28:54,949 INFO L226 Difference]: Without dead ends: 55 [2018-01-25 05:28:54,949 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-25 05:28:54,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-25 05:28:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-25 05:28:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:28:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-25 05:28:54,954 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 20 [2018-01-25 05:28:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:54,954 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-25 05:28:54,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:28:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-25 05:28:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:28:54,955 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:54,955 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] [2018-01-25 05:28:54,955 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:54,956 INFO L82 PathProgramCache]: Analyzing trace with hash -541357888, now seen corresponding path program 1 times [2018-01-25 05:28:54,956 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:54,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:54,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:54,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:54,957 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:54,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:55,009 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-25 05:28:55,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:55,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:28:55,010 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:55,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:55,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:55,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:55,011 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 6 states. [2018-01-25 05:28:55,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:55,100 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-01-25 05:28:55,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:55,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 05:28:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:55,101 INFO L225 Difference]: With dead ends: 55 [2018-01-25 05:28:55,101 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:28:55,102 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-25 05:28:55,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:28:55,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 05:28:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:28:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-01-25 05:28:55,108 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 22 [2018-01-25 05:28:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:55,108 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-01-25 05:28:55,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-01-25 05:28:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:28:55,109 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:55,109 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] [2018-01-25 05:28:55,109 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash -541357887, now seen corresponding path program 1 times [2018-01-25 05:28:55,110 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:55,110 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:55,111 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:55,111 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:55,111 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:55,123 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:55,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-25 05:28:55,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:55,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:28:55,329 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:55,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:28:55,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:28:55,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:28:55,330 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 9 states. [2018-01-25 05:28:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:55,424 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-01-25 05:28:55,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:28:55,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 05:28:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:55,426 INFO L225 Difference]: With dead ends: 57 [2018-01-25 05:28:55,426 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 05:28:55,427 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:28:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 05:28:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-01-25 05:28:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:28:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-25 05:28:55,433 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2018-01-25 05:28:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:55,434 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-25 05:28:55,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:28:55,434 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-25 05:28:55,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:28:55,435 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:55,435 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-25 05:28:55,435 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash -553886463, now seen corresponding path program 1 times [2018-01-25 05:28:55,436 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:55,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:55,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:55,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:55,437 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:55,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:55,499 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-25 05:28:55,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:55,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:28:55,500 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:55,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:55,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:55,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:55,501 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-01-25 05:28:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:55,620 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-25 05:28:55,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:55,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 05:28:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:55,622 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:28:55,622 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 05:28:55,622 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-25 05:28:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 05:28:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 05:28:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 05:28:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-25 05:28:55,629 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 24 [2018-01-25 05:28:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:55,629 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-25 05:28:55,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-25 05:28:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 05:28:55,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:55,630 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-25 05:28:55,630 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash -553886462, now seen corresponding path program 1 times [2018-01-25 05:28:55,631 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:55,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:55,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:55,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:55,632 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:55,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:55,773 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-25 05:28:55,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:55,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:28:55,774 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:55,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:28:55,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:28:55,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:28:55,775 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 8 states. [2018-01-25 05:28:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:55,892 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-01-25 05:28:55,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:28:55,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-25 05:28:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:55,893 INFO L225 Difference]: With dead ends: 65 [2018-01-25 05:28:55,893 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 05:28:55,894 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:28:55,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 05:28:55,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-01-25 05:28:55,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:28:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-25 05:28:55,900 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 24 [2018-01-25 05:28:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:55,901 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-25 05:28:55,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:28:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-25 05:28:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:28:55,902 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:55,902 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] [2018-01-25 05:28:55,902 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1181606150, now seen corresponding path program 1 times [2018-01-25 05:28:55,903 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:55,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:55,904 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:55,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:55,904 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:55,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:56,056 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-25 05:28:56,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:56,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:28:56,057 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:56,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:56,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:56,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:56,058 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-01-25 05:28:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:56,192 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-25 05:28:56,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:28:56,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 05:28:56,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:56,194 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:28:56,194 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 05:28:56,194 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:28:56,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 05:28:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-25 05:28:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 05:28:56,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-25 05:28:56,200 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-01-25 05:28:56,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:56,200 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-25 05:28:56,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-25 05:28:56,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:28:56,201 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:56,201 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] [2018-01-25 05:28:56,201 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:56,202 INFO L82 PathProgramCache]: Analyzing trace with hash 290777922, now seen corresponding path program 1 times [2018-01-25 05:28:56,202 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:56,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:56,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:56,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:56,203 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:56,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:56,258 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-25 05:28:56,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:56,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:28:56,258 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:56,258 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:28:56,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:28:56,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:28:56,259 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-01-25 05:28:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:56,308 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-25 05:28:56,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:28:56,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 05:28:56,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:56,308 INFO L225 Difference]: With dead ends: 43 [2018-01-25 05:28:56,308 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 05:28:56,309 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-25 05:28:56,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 05:28:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-25 05:28:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:28:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-25 05:28:56,313 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 26 [2018-01-25 05:28:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:56,314 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-25 05:28:56,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:28:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-25 05:28:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:28:56,315 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:56,315 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] [2018-01-25 05:28:56,315 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:56,315 INFO L82 PathProgramCache]: Analyzing trace with hash 290777923, now seen corresponding path program 1 times [2018-01-25 05:28:56,315 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:56,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:56,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:56,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:56,317 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:56,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:56,561 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-25 05:28:56,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:56,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:28:56,561 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:56,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:28:56,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:28:56,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:28:56,562 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 11 states. [2018-01-25 05:28:56,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:56,756 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-01-25 05:28:56,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:28:56,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-25 05:28:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:56,757 INFO L225 Difference]: With dead ends: 52 [2018-01-25 05:28:56,757 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:28:56,757 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-01-25 05:28:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:28:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-01-25 05:28:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 05:28:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-01-25 05:28:56,761 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 26 [2018-01-25 05:28:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:56,761 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-01-25 05:28:56,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:28:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-01-25 05:28:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:28:56,762 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:56,762 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:56,762 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash -716230416, now seen corresponding path program 1 times [2018-01-25 05:28:56,762 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:56,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:56,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:56,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:56,763 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:56,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:57,001 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-25 05:28:57,002 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:28:57,002 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 05:28:57,002 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:28:57,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:28:57,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:28:57,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:28:57,003 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2018-01-25 05:28:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:28:57,189 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-25 05:28:57,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:28:57,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-01-25 05:28:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:28:57,190 INFO L225 Difference]: With dead ends: 76 [2018-01-25 05:28:57,190 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 05:28:57,191 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:28:57,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 05:28:57,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-25 05:28:57,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 05:28:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-01-25 05:28:57,195 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 29 [2018-01-25 05:28:57,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:28:57,195 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-01-25 05:28:57,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:28:57,195 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-01-25 05:28:57,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:28:57,196 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:28:57,196 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:28:57,196 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:28:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1773298546, now seen corresponding path program 1 times [2018-01-25 05:28:57,196 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:28:57,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:57,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:57,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:28:57,197 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:28:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:57,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:28:57,511 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-25 05:28:57,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:57,512 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:28:57,513 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 05:28:57,514 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [46], [48], [49], [50], [64], [65], [72], [74], [79], [85], [86], [87], [89] [2018-01-25 05:28:57,562 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:28:57,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:28:59,031 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:28:59,033 INFO L268 AbstractInterpreter]: Visited 28 different actions 37 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 05:28:59,050 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:28:59,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:28:59,050 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-25 05:28:59,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:28:59,064 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:28:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:28:59,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:28:59,144 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-25 05:28:59,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:59,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:59,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:28:59,197 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:59,198 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:28:59,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, 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-25 05:28:59,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:59,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:59,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 05:28:59,300 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-25 05:28:59,302 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-25 05:28:59,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:59,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:59,313 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-25 05:28:59,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-25 05:28:59,360 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-25 05:28:59,385 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-25 05:28:59,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:59,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:28:59,424 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-25 05:28:59,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-25 05:28:59,680 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-25 05:28:59,689 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-25 05:28:59,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:28:59,701 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-25 05:28:59,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:28:59,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:28:59,720 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-25 05:28:59,721 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-25 05:28:59,769 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-25 05:28:59,769 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:00,019 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-25 05:29:00,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,029 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-25 05:29:00,047 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-25 05:29:00,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,057 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-25 05:29:00,057 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-01-25 05:29:00,102 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-25 05:29:00,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:00,137 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 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 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:29:00,143 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:00,143 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:29:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:00,231 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:00,235 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-25 05:29:00,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,248 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-25 05:29:00,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:29:00,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:29:00,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:29:00,324 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-25 05:29:00,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,331 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-25 05:29:00,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:29:00,423 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-25 05:29:00,425 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-25 05:29:00,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-25 05:29:00,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-25 05:29:00,496 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-25 05:29:00,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,506 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-25 05:29:00,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-25 05:29:00,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-25 05:29:00,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-25 05:29:00,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:00,970 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-25 05:29:00,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:00,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:29:00,979 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-25 05:29:00,979 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-01-25 05:29:01,068 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-25 05:29:01,068 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:01,258 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-25 05:29:01,267 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-25 05:29:01,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:01,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:01,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:01,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-25 05:29:01,432 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-25 05:29:01,434 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:29:01,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9, 13, 11] total 47 [2018-01-25 05:29:01,434 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:29:01,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 05:29:01,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 05:29:01,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2085, Unknown=0, NotChecked=0, Total=2256 [2018-01-25 05:29:01,436 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 23 states. [2018-01-25 05:29:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:02,577 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-01-25 05:29:02,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 05:29:02,577 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-01-25 05:29:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:02,578 INFO L225 Difference]: With dead ends: 56 [2018-01-25 05:29:02,578 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:29:02,579 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 77 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=302, Invalid=3004, Unknown=0, NotChecked=0, Total=3306 [2018-01-25 05:29:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:29:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-01-25 05:29:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:29:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-25 05:29:02,583 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 29 [2018-01-25 05:29:02,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:02,583 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-25 05:29:02,583 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 05:29:02,583 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-25 05:29:02,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:29:02,584 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:02,584 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:29:02,584 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:29:02,584 INFO L82 PathProgramCache]: Analyzing trace with hash -962114157, now seen corresponding path program 1 times [2018-01-25 05:29:02,584 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:02,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:02,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:02,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:02,585 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:02,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:02,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:02,922 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:29:02,923 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-25 05:29:02,923 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [46], [49], [50], [52], [64], [65], [72], [74], [79], [85], [86], [87], [89] [2018-01-25 05:29:02,924 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:29:02,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:29:03,864 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:29:03,865 INFO L268 AbstractInterpreter]: Visited 28 different actions 37 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 05:29:03,873 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:29:03,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:03,874 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:29:03,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:03,886 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:29:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:03,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:03,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-25 05:29:03,949 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-25 05:29:03,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:03,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:04,020 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-25 05:29:04,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-25 05:29:04,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-01-25 05:29:04,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-01-25 05:29:04,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:04,500 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 27 treesize of output 25 [2018-01-25 05:29:04,500 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:04,516 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 19 treesize of output 14 [2018-01-25 05:29:04,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:04,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:29:04,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:29:04,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-25 05:29:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:04,588 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:04,961 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 15 treesize of output 11 [2018-01-25 05:29:04,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:04,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-01-25 05:29:05,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-01-25 05:29:05,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:05,038 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 14 treesize of output 12 [2018-01-25 05:29:05,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:05,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-25 05:29:05,051 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:05,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:05,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:05,063 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:73, output treesize:7 [2018-01-25 05:29:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:05,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:05,088 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:29:05,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:05,091 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:29:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:05,159 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:05,236 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-25 05:29:05,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:05,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:05,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-01-25 05:29:05,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:29:05,304 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-25 05:29:05,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:05,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:05,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:05,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-01-25 05:29:05,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-01-25 05:29:05,622 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-25 05:29:05,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:05,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:29:05,635 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-25 05:29:05,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-01-25 05:29:05,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:05,741 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:08,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-25 05:29:09,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-25 05:29:09,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:09,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:09,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:29:09,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:39 [2018-01-25 05:29:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:09,140 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:29:09,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12, 16, 14] total 52 [2018-01-25 05:29:09,140 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:29:09,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-25 05:29:09,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-25 05:29:09,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2531, Unknown=1, NotChecked=0, Total=2756 [2018-01-25 05:29:09,142 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 23 states. [2018-01-25 05:29:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:11,278 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-01-25 05:29:11,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:29:11,279 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-01-25 05:29:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:11,279 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:29:11,279 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 05:29:11,280 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=363, Invalid=3668, Unknown=1, NotChecked=0, Total=4032 [2018-01-25 05:29:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 05:29:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 05:29:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:29:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-01-25 05:29:11,288 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 31 [2018-01-25 05:29:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:11,288 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-01-25 05:29:11,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-25 05:29:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-01-25 05:29:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-25 05:29:11,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:11,290 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] [2018-01-25 05:29:11,290 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:29:11,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1173736108, now seen corresponding path program 1 times [2018-01-25 05:29:11,290 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:11,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:11,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:11,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:11,292 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:11,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:11,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:11,422 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:29:11,423 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-25 05:29:11,423 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [46], [49], [50], [64], [65], [67], [72], [74], [79], [85], [86], [87], [89] [2018-01-25 05:29:11,424 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:29:11,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:29:12,363 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:29:12,364 INFO L268 AbstractInterpreter]: Visited 28 different actions 37 times. Merged at 9 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-01-25 05:29:12,371 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:29:12,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:12,372 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:29:12,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:12,381 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:29:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:12,409 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:12,425 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:12,449 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 8 treesize of output 6 [2018-01-25 05:29:12,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:12,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:12,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-25 05:29:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:12,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:12,504 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 05:29:12,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:12,508 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:29:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:12,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:12,557 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:12,560 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 8 treesize of output 6 [2018-01-25 05:29:12,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:12,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:12,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-01-25 05:29:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:12,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:29:12,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5, 5, 5] total 14 [2018-01-25 05:29:12,569 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:29:12,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:29:12,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:29:12,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-25 05:29:12,570 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 11 states. [2018-01-25 05:29:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:12,660 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-01-25 05:29:12,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:29:12,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-01-25 05:29:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:12,660 INFO L225 Difference]: With dead ends: 50 [2018-01-25 05:29:12,660 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:29:12,661 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-01-25 05:29:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:29:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-01-25 05:29:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:29:12,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-25 05:29:12,666 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 33 [2018-01-25 05:29:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:12,666 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-25 05:29:12,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:29:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-25 05:29:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 05:29:12,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:12,667 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:29:12,667 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:29:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1615722261, now seen corresponding path program 1 times [2018-01-25 05:29:12,668 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:12,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:12,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:12,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:12,668 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:12,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:12,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:12,836 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:29:12,836 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 05:29:12,837 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [20], [21], [22], [25], [28], [37], [41], [45], [46], [49], [50], [55], [56], [59], [62], [64], [65], [72], [74], [79], [85], [86], [87], [89] [2018-01-25 05:29:12,838 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:29:12,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:29:13,418 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:29:13,418 INFO L268 AbstractInterpreter]: Visited 31 different actions 43 times. Merged at 12 different actions 12 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-01-25 05:29:13,437 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:29:13,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:13,438 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:29:13,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:13,443 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:29:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:13,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:13,521 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:13,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2018-01-25 05:29:13,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:13,554 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 12 treesize of output 10 [2018-01-25 05:29:13,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:13,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:29:13,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-01-25 05:29:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:13,628 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:29:13,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [11] total 18 [2018-01-25 05:29:13,628 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:29:13,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:29:13,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:29:13,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:29:13,629 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 7 states. [2018-01-25 05:29:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:13,697 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-01-25 05:29:13,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:29:13,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-01-25 05:29:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:13,698 INFO L225 Difference]: With dead ends: 46 [2018-01-25 05:29:13,698 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 05:29:13,698 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-01-25 05:29:13,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 05:29:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-25 05:29:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 05:29:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-01-25 05:29:13,703 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 35 [2018-01-25 05:29:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:13,703 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-01-25 05:29:13,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:29:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-01-25 05:29:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 05:29:13,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:13,704 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:29:13,704 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:29:13,704 INFO L82 PathProgramCache]: Analyzing trace with hash -48907298, now seen corresponding path program 2 times [2018-01-25 05:29:13,705 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:13,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:13,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:29:13,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:13,706 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:13,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:14,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:14,168 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:29:14,168 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:29:14,168 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:29:14,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:14,168 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-25 05:29:14,175 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:29:14,176 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:29:14,189 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:29:14,208 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:29:14,211 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:29:14,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:14,221 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-25 05:29:14,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,228 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-25 05:29:14,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:29:14,284 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:29:14,285 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-25 05:29:14,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:29:14,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:29:14,299 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-25 05:29:14,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:29:14,345 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-25 05:29:14,347 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-25 05:29:14,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,353 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-25 05:29:14,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-25 05:29:14,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-25 05:29:14,382 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-25 05:29:14,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-25 05:29:14,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-25 05:29:14,717 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 34 treesize of output 32 [2018-01-25 05:29:14,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-25 05:29:14,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:14,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-25 05:29:14,736 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:14,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:29:14,761 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-25 05:29:14,761 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-25 05:29:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:14,904 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:15,365 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-25 05:29:15,381 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-25 05:29:15,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,390 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-01-25 05:29:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:15,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:15,679 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-25 05:29:15,683 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:29:15,683 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:29:15,700 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:29:15,728 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:29:15,789 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:29:15,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:15,799 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-25 05:29:15,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,818 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-25 05:29:15,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:29:15,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:29:15,873 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-25 05:29:15,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:29:15,883 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:29:15,884 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-25 05:29:15,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-25 05:29:15,980 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-25 05:29:15,981 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-25 05:29:15,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:15,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-25 05:29:16,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-25 05:29:16,035 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-25 05:29:16,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:16,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:16,044 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-25 05:29:16,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-25 05:29:16,239 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 34 treesize of output 32 [2018-01-25 05:29:16,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-25 05:29:16,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:16,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-25 05:29:16,257 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:16,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 05:29:16,273 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-25 05:29:16,274 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-25 05:29:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:16,283 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:16,501 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-25 05:29:16,511 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-25 05:29:16,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:16,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:16,518 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-25 05:29:16,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 05:29:16,981 WARN L143 SmtUtils]: Spent 343ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-25 05:29:17,375 WARN L143 SmtUtils]: Spent 334ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-25 05:29:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:17,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:29:17,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 13, 15, 13] total 48 [2018-01-25 05:29:17,391 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:29:17,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-25 05:29:17,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-25 05:29:17,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2174, Unknown=0, NotChecked=0, Total=2352 [2018-01-25 05:29:17,393 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 29 states. [2018-01-25 05:29:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:18,592 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-01-25 05:29:18,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 05:29:18,592 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2018-01-25 05:29:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:18,593 INFO L225 Difference]: With dead ends: 43 [2018-01-25 05:29:18,593 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 05:29:18,594 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 111 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 825 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=404, Invalid=3378, Unknown=0, NotChecked=0, Total=3782 [2018-01-25 05:29:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 05:29:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-01-25 05:29:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 05:29:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-01-25 05:29:18,601 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-01-25 05:29:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:18,601 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-01-25 05:29:18,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-25 05:29:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-01-25 05:29:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-25 05:29:18,602 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:29:18,602 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:29:18,602 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-01-25 05:29:18,603 INFO L82 PathProgramCache]: Analyzing trace with hash 244726527, now seen corresponding path program 2 times [2018-01-25 05:29:18,603 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:29:18,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:18,604 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:29:18,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:29:18,604 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:29:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:29:18,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:29:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:18,939 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:18,940 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:29:18,940 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:29:18,940 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:29:18,940 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:18,940 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-25 05:29:18,945 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:29:18,945 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:29:18,955 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:29:18,962 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:29:18,965 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:29:18,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:18,970 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-25 05:29:18,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:18,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:18,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:29:19,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-25 05:29:19,006 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-25 05:29:19,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:19,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:19,011 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-25 05:29:19,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-01-25 05:29:19,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-01-25 05:29:19,295 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 29 treesize of output 22 [2018-01-25 05:29:19,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:19,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2018-01-25 05:29:19,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:19,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2018-01-25 05:29:19,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:19,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:29:19,356 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-25 05:29:19,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-01-25 05:29:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:19,398 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:20,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2018-01-25 05:29:20,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-01-25 05:29:20,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,072 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 14 treesize of output 12 [2018-01-25 05:29:20,073 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-01-25 05:29:20,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:43 [2018-01-25 05:29:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:20,197 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:29:20,197 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-25 05:29:20,200 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:29:20,200 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:29:20,217 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:29:20,244 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:29:20,303 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:29:20,309 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:29:20,311 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-25 05:29:20,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:29:20,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 05:29:20,351 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-25 05:29:20,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 05:29:20,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-01-25 05:29:20,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-01-25 05:29:20,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:20,688 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 28 treesize of output 26 [2018-01-25 05:29:20,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-25 05:29:20,701 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 20 treesize of output 15 [2018-01-25 05:29:20,701 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:20,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:29:20,718 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-25 05:29:20,718 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-25 05:29:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:20,744 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:29:29,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-25 05:29:29,248 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 24 treesize of output 16 [2018-01-25 05:29:29,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:29,260 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 16 treesize of output 14 [2018-01-25 05:29:29,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:29,270 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-01-25 05:29:29,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:29:29,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:29:29,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:29:29,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:65, output treesize:74 [2018-01-25 05:29:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:29:29,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:29:29,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16, 15, 15] total 60 [2018-01-25 05:29:29,477 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:29:29,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-25 05:29:29,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-25 05:29:29,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=3309, Unknown=8, NotChecked=0, Total=3660 [2018-01-25 05:29:29,478 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 28 states. [2018-01-25 05:29:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:29:30,514 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-01-25 05:29:30,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:29:30,514 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2018-01-25 05:29:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:29:30,514 INFO L225 Difference]: With dead ends: 42 [2018-01-25 05:29:30,514 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 05:29:30,516 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 9 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=710, Invalid=4982, Unknown=8, NotChecked=0, Total=5700 [2018-01-25 05:29:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 05:29:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 05:29:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 05:29:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 05:29:30,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-01-25 05:29:30,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:29:30,516 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 05:29:30,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-25 05:29:30,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 05:29:30,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 05:29:30,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 05:29:30,880 WARN L146 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 107 DAG size of output 84 Received shutdown request... [2018-01-25 05:29:48,097 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-01-25 05:29:48,098 INFO L168 Benchmark]: Toolchain (without parser) took 55186.15 ms. Allocated memory was 302.5 MB in the beginning and 842.0 MB in the end (delta: 539.5 MB). Free memory was 261.6 MB in the beginning and 519.1 MB in the end (delta: -257.6 MB). Peak memory consumption was 281.9 MB. Max. memory is 5.3 GB. [2018-01-25 05:29:48,098 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 302.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:29:48,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.14 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:29:48,099 INFO L168 Benchmark]: Boogie Preprocessor took 29.24 ms. Allocated memory is still 302.5 MB. Free memory was 251.5 MB in the beginning and 249.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:29:48,099 INFO L168 Benchmark]: RCFGBuilder took 268.64 ms. Allocated memory is still 302.5 MB. Free memory was 249.4 MB in the beginning and 228.9 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:29:48,099 INFO L168 Benchmark]: TraceAbstraction took 54686.77 ms. Allocated memory was 302.5 MB in the beginning and 842.0 MB in the end (delta: 539.5 MB). Free memory was 228.9 MB in the beginning and 519.1 MB in the end (delta: -290.2 MB). Peak memory consumption was 249.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:29:48,101 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.20 ms. Allocated memory is still 302.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 193.14 ms. Allocated memory is still 302.5 MB. Free memory was 261.6 MB in the beginning and 251.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.24 ms. Allocated memory is still 302.5 MB. Free memory was 251.5 MB in the beginning and 249.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 268.64 ms. Allocated memory is still 302.5 MB. Free memory was 249.4 MB in the beginning and 228.9 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54686.77 ms. Allocated memory was 302.5 MB in the beginning and 842.0 MB in the end (delta: 539.5 MB). Free memory was 228.9 MB in the beginning and 519.1 MB in the end (delta: -290.2 MB). Peak memory consumption was 249.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 333 LocStat_NO_SUPPORTING_DISEQUALITIES : 66 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.105826 RENAME_VARIABLES(MILLISECONDS) : 0.704193 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.049725 PROJECTAWAY(MILLISECONDS) : 1.632875 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.110441 DISJOIN(MILLISECONDS) : 0.819832 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.732388 ADD_EQUALITY(MILLISECONDS) : 0.020534 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017158 #CONJOIN_DISJUNCTIVE : 66 #RENAME_VARIABLES : 102 #UNFREEZE : 0 #CONJOIN : 117 #PROJECTAWAY : 87 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 99 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 321 LocStat_NO_SUPPORTING_DISEQUALITIES : 66 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.744957 RENAME_VARIABLES(MILLISECONDS) : 0.368410 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.711987 PROJECTAWAY(MILLISECONDS) : 0.805239 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.074459 DISJOIN(MILLISECONDS) : 0.339273 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.386415 ADD_EQUALITY(MILLISECONDS) : 0.012708 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.024210 #CONJOIN_DISJUNCTIVE : 66 #RENAME_VARIABLES : 102 #UNFREEZE : 0 #CONJOIN : 117 #PROJECTAWAY : 87 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 99 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 342 LocStat_NO_SUPPORTING_DISEQUALITIES : 66 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 64 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.401562 RENAME_VARIABLES(MILLISECONDS) : 0.549154 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.345976 PROJECTAWAY(MILLISECONDS) : 1.086640 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.059217 DISJOIN(MILLISECONDS) : 0.605772 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.575877 ADD_EQUALITY(MILLISECONDS) : 0.014828 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009499 #CONJOIN_DISJUNCTIVE : 66 #RENAME_VARIABLES : 102 #UNFREEZE : 0 #CONJOIN : 117 #PROJECTAWAY : 87 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 99 #ADD_EQUALITY : 66 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 30 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 373 LocStat_NO_SUPPORTING_DISEQUALITIES : 75 LocStat_NO_DISJUNCTIONS : -60 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 37 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.158928 RENAME_VARIABLES(MILLISECONDS) : 0.364631 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.556553 PROJECTAWAY(MILLISECONDS) : 0.053897 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.074821 DISJOIN(MILLISECONDS) : 0.287700 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.380787 ADD_EQUALITY(MILLISECONDS) : 0.015615 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010294 #CONJOIN_DISJUNCTIVE : 78 #RENAME_VARIABLES : 122 #UNFREEZE : 0 #CONJOIN : 133 #PROJECTAWAY : 100 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 119 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 180. RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-29-48-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-29-48-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-29-48-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-29-48-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-29-48-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-29-48-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-29-48-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_05-29-48-113.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_05-29-48-113.csv Completed graceful shutdown