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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:56:06,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:56:06,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:56:06,074 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:56:06,074 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:56:06,075 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:56:06,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:56:06,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:56:06,080 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:56:06,081 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:56:06,082 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:56:06,082 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:56:06,083 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:56:06,084 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:56:06,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:56:06,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:56:06,089 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:56:06,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:56:06,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:56:06,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:56:06,096 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:56:06,096 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:56:06,097 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:56:06,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:56:06,098 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:56:06,100 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:56:06,100 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:56:06,101 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:56:06,101 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:56:06,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:56:06,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:56:06,102 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:56:06,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:56:06,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:56:06,111 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:56:06,112 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:56:06,112 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:56:06,112 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:56:06,112 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:56:06,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:56:06,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:56:06,113 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:56:06,113 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:56:06,113 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:56:06,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:56:06,113 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:56:06,113 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:56:06,113 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:56:06,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:56:06,114 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:56:06,114 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:56:06,114 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:56:06,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:56:06,114 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:56:06,115 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:56:06,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:56:06,115 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:56:06,115 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:56:06,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:56:06,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:56:06,116 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:56:06,116 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:56:06,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:56:06,116 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:56:06,117 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:56:06,117 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:56:06,148 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:56:06,159 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:56:06,163 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:56:06,164 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:56:06,164 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:56:06,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:56:06,336 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:56:06,341 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:56:06,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:56:06,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:56:06,347 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:56:06,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:56:06" (1/1) ... [2018-01-24 12:56:06,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca156b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06, skipping insertion in model container [2018-01-24 12:56:06,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:56:06" (1/1) ... [2018-01-24 12:56:06,364 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:56:06,402 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:56:06,527 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:56:06,548 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:56:06,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06 WrapperNode [2018-01-24 12:56:06,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:56:06,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:56:06,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:56:06,559 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:56:06,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06" (1/1) ... [2018-01-24 12:56:06,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06" (1/1) ... [2018-01-24 12:56:06,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06" (1/1) ... [2018-01-24 12:56:06,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06" (1/1) ... [2018-01-24 12:56:06,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06" (1/1) ... [2018-01-24 12:56:06,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06" (1/1) ... [2018-01-24 12:56:06,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06" (1/1) ... [2018-01-24 12:56:06,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:56:06,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:56:06,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:56:06,599 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:56:06,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:56:06,650 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:56:06,650 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:56:06,650 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-24 12:56:06,650 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-24 12:56:06,650 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-01-24 12:56:06,650 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:56:06,650 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:56:06,651 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:56:06,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:56:06,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:56:06,651 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:56:06,651 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:56:06,651 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-24 12:56:06,652 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-24 12:56:06,652 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-01-24 12:56:06,652 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:56:06,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:56:06,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:56:06,973 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:56:06,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:56:06 BoogieIcfgContainer [2018-01-24 12:56:06,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:56:06,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:56:06,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:56:06,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:56:06,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:56:06" (1/3) ... [2018-01-24 12:56:06,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8772f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:56:06, skipping insertion in model container [2018-01-24 12:56:06,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:56:06" (2/3) ... [2018-01-24 12:56:06,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8772f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:56:06, skipping insertion in model container [2018-01-24 12:56:06,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:56:06" (3/3) ... [2018-01-24 12:56:06,982 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:56:06,990 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:56:06,996 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-24 12:56:07,042 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:56:07,043 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:56:07,043 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:56:07,043 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:56:07,043 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:56:07,043 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:56:07,043 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:56:07,044 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:56:07,044 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:56:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-01-24 12:56:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:56:07,071 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:07,072 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:07,072 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-01-24 12:56:07,080 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:07,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:07,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:07,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:07,122 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:07,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:07,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:07,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:56:07,300 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:07,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:56:07,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:56:07,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:56:07,389 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-01-24 12:56:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:07,565 INFO L93 Difference]: Finished difference Result 147 states and 171 transitions. [2018-01-24 12:56:07,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:56:07,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 12:56:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:07,573 INFO L225 Difference]: With dead ends: 147 [2018-01-24 12:56:07,573 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 12:56:07,576 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:56:07,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 12:56:07,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-24 12:56:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 12:56:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-01-24 12:56:07,609 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-01-24 12:56:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:07,609 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-01-24 12:56:07,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:56:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-01-24 12:56:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 12:56:07,610 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:07,610 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:07,610 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:07,610 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-01-24 12:56:07,610 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:07,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:07,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:07,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:07,612 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:07,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:07,749 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:07,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:56:07,749 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:07,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:56:07,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:56:07,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:56:07,751 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-01-24 12:56:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:07,930 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-01-24 12:56:07,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:56:07,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 12:56:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:07,932 INFO L225 Difference]: With dead ends: 86 [2018-01-24 12:56:07,933 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 12:56:07,934 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:56:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 12:56:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-24 12:56:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-24 12:56:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-24 12:56:07,944 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-01-24 12:56:07,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:07,944 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-24 12:56:07,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:56:07,945 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-24 12:56:07,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:56:07,945 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:07,946 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:07,946 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:07,946 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-01-24 12:56:07,946 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:07,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:07,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:07,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:07,948 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:07,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:08,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:08,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:08,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:56:08,003 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:08,003 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:56:08,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:56:08,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:56:08,004 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-01-24 12:56:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:08,085 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-01-24 12:56:08,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:56:08,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 12:56:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:08,086 INFO L225 Difference]: With dead ends: 85 [2018-01-24 12:56:08,086 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 12:56:08,087 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:56:08,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 12:56:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-24 12:56:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 12:56:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-01-24 12:56:08,096 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-01-24 12:56:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:08,096 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-01-24 12:56:08,096 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:56:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-01-24 12:56:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 12:56:08,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:08,097 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:08,097 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-01-24 12:56:08,098 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:08,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:08,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:08,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:08,099 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:08,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:08,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:08,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:56:08,181 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:08,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:56:08,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:56:08,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:56:08,182 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-01-24 12:56:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:08,234 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-01-24 12:56:08,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:56:08,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 12:56:08,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:08,235 INFO L225 Difference]: With dead ends: 84 [2018-01-24 12:56:08,236 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 12:56:08,236 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:56:08,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 12:56:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-24 12:56:08,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 12:56:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-01-24 12:56:08,241 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-01-24 12:56:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:08,241 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-01-24 12:56:08,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:56:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-01-24 12:56:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:56:08,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:08,242 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:08,242 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-01-24 12:56:08,243 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:08,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:08,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:08,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:08,244 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:08,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:08,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:08,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:56:08,323 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:08,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:56:08,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:56:08,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:56:08,323 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-01-24 12:56:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:08,398 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-01-24 12:56:08,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:56:08,399 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 12:56:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:08,400 INFO L225 Difference]: With dead ends: 83 [2018-01-24 12:56:08,401 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 12:56:08,401 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:56:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 12:56:08,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-24 12:56:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 12:56:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-24 12:56:08,410 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-01-24 12:56:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:08,411 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-24 12:56:08,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:56:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-24 12:56:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:56:08,412 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:08,412 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:08,412 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:08,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-01-24 12:56:08,412 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:08,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:08,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:08,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:08,414 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:08,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:08,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:08,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:56:08,498 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:08,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:56:08,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:56:08,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:56:08,499 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-01-24 12:56:08,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:08,605 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-01-24 12:56:08,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:56:08,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-24 12:56:08,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:08,607 INFO L225 Difference]: With dead ends: 82 [2018-01-24 12:56:08,607 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 12:56:08,607 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:56:08,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 12:56:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-24 12:56:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-24 12:56:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-24 12:56:08,615 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-01-24 12:56:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:08,616 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-24 12:56:08,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:56:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-24 12:56:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:56:08,617 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:08,617 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] [2018-01-24 12:56:08,617 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-01-24 12:56:08,618 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:08,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:08,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:08,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:08,619 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:08,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:08,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:08,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:56:08,699 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:08,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:56:08,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:56:08,700 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:56:08,700 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-01-24 12:56:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:08,881 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-01-24 12:56:08,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:56:08,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 12:56:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:08,883 INFO L225 Difference]: With dead ends: 81 [2018-01-24 12:56:08,883 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 12:56:08,883 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:56:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 12:56:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 12:56:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 12:56:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-01-24 12:56:08,889 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-01-24 12:56:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:08,890 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-01-24 12:56:08,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:56:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-01-24 12:56:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:56:08,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:08,890 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] [2018-01-24 12:56:08,890 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-01-24 12:56:08,891 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:08,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:08,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:08,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:08,892 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:08,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:09,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:09,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:56:09,089 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:09,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:56:09,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:56:09,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:56:09,090 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-01-24 12:56:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:09,302 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2018-01-24 12:56:09,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:56:09,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 12:56:09,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:09,305 INFO L225 Difference]: With dead ends: 165 [2018-01-24 12:56:09,306 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 12:56:09,306 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-01-24 12:56:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 12:56:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-01-24 12:56:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 12:56:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-01-24 12:56:09,314 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-01-24 12:56:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:09,315 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-01-24 12:56:09,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:56:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-01-24 12:56:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:56:09,316 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:09,316 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] [2018-01-24 12:56:09,316 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:09,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-01-24 12:56:09,317 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:09,317 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:09,317 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:09,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:09,318 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:09,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:09,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:09,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 12:56:09,764 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:09,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:56:09,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:56:09,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:56:09,764 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 16 states. [2018-01-24 12:56:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:10,548 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2018-01-24 12:56:10,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 12:56:10,548 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-01-24 12:56:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:10,550 INFO L225 Difference]: With dead ends: 153 [2018-01-24 12:56:10,550 INFO L226 Difference]: Without dead ends: 152 [2018-01-24 12:56:10,551 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:56:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-24 12:56:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2018-01-24 12:56:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-24 12:56:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2018-01-24 12:56:10,566 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 23 [2018-01-24 12:56:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:10,566 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2018-01-24 12:56:10,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:56:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2018-01-24 12:56:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:56:10,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:10,568 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] [2018-01-24 12:56:10,568 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:10,568 INFO L82 PathProgramCache]: Analyzing trace with hash -197547585, now seen corresponding path program 1 times [2018-01-24 12:56:10,568 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:10,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:10,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:10,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:10,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:10,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:10,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:10,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 12:56:10,763 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:10,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:56:10,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:56:10,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:56:10,764 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 13 states. [2018-01-24 12:56:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:11,040 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2018-01-24 12:56:11,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:56:11,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-01-24 12:56:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:11,042 INFO L225 Difference]: With dead ends: 150 [2018-01-24 12:56:11,043 INFO L226 Difference]: Without dead ends: 149 [2018-01-24 12:56:11,043 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:56:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-24 12:56:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 96. [2018-01-24 12:56:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-24 12:56:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-01-24 12:56:11,050 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-01-24 12:56:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:11,051 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-01-24 12:56:11,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:56:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-01-24 12:56:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 12:56:11,052 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:11,052 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] [2018-01-24 12:56:11,052 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-01-24 12:56:11,053 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:11,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:11,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:11,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:11,054 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:11,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:11,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:11,290 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:56:11,299 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:11,299 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:11,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:11,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:56:11,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:11,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:11,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:56:11,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:56:11,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:56:11,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:11,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:11,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:11,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 12:56:11,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:56:11,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:56:11,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:56:11,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:11,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:11,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 12:56:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:11,665 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:12,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 12:56:12,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:56:12,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:12,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:12,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:12,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 12:56:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:12,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:12,304 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-24 12:56:12,310 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:12,311 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:12,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:12,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:56:12,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:12,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:12,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:56:12,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:56:12,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:56:12,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:12,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:12,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:12,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-24 12:56:12,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:56:12,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:56:12,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:56:12,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:12,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:12,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-24 12:56:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:12,464 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:12,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 12:56:12,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:56:12,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:12,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:12,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:12,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 12:56:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:12,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:56:12,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 32 [2018-01-24 12:56:12,610 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:56:12,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 12:56:12,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 12:56:12,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 12:56:12,612 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 22 states. [2018-01-24 12:56:13,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:13,478 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-24 12:56:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 12:56:13,478 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-01-24 12:56:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:13,479 INFO L225 Difference]: With dead ends: 101 [2018-01-24 12:56:13,479 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 12:56:13,480 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 12:56:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 12:56:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-01-24 12:56:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-24 12:56:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-01-24 12:56:13,489 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 27 [2018-01-24 12:56:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:13,489 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-01-24 12:56:13,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 12:56:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-01-24 12:56:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:56:13,490 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:13,490 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:13,490 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:13,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-01-24 12:56:13,491 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:13,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:13,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:13,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:13,492 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:13,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:13,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:13,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:56:13,603 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:13,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:56:13,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:56:13,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:56:13,604 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-01-24 12:56:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:13,771 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-01-24 12:56:13,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:56:13,772 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 12:56:13,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:13,772 INFO L225 Difference]: With dead ends: 93 [2018-01-24 12:56:13,772 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 12:56:13,773 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:56:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 12:56:13,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-24 12:56:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 12:56:13,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-24 12:56:13,778 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-01-24 12:56:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:13,778 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-24 12:56:13,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:56:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-24 12:56:13,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:56:13,779 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:13,779 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:13,779 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:13,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-01-24 12:56:13,779 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:13,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:13,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:13,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:13,780 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:13,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:13,833 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:13,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 12:56:13,833 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:13,834 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:56:13,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:56:13,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:56:13,834 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 6 states. [2018-01-24 12:56:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:13,968 INFO L93 Difference]: Finished difference Result 68 states and 75 transitions. [2018-01-24 12:56:13,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:56:13,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 12:56:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:13,969 INFO L225 Difference]: With dead ends: 68 [2018-01-24 12:56:13,970 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 12:56:13,970 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:56:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 12:56:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-24 12:56:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 12:56:13,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-24 12:56:13,976 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 31 [2018-01-24 12:56:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:13,977 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-24 12:56:13,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:56:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-24 12:56:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 12:56:13,978 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:13,978 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:13,978 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:13,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-01-24 12:56:13,978 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:13,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:13,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:13,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:13,979 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:13,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:14,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:14,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:56:14,116 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:14,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:56:14,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:56:14,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:56:14,117 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2018-01-24 12:56:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:14,206 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-01-24 12:56:14,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:56:14,206 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-24 12:56:14,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:14,207 INFO L225 Difference]: With dead ends: 73 [2018-01-24 12:56:14,207 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 12:56:14,207 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:56:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 12:56:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-01-24 12:56:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 12:56:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-01-24 12:56:14,212 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 31 [2018-01-24 12:56:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:14,213 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-01-24 12:56:14,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:56:14,213 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-01-24 12:56:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 12:56:14,213 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:14,214 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:14,214 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:14,214 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-01-24 12:56:14,214 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:14,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:14,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:14,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:14,215 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:14,234 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:14,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:14,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 12:56:14,544 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:14,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:56:14,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:56:14,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:56:14,545 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2018-01-24 12:56:14,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:14,793 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2018-01-24 12:56:14,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:56:14,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-01-24 12:56:14,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:14,794 INFO L225 Difference]: With dead ends: 127 [2018-01-24 12:56:14,794 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 12:56:14,795 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:56:14,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 12:56:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-24 12:56:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 12:56:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-24 12:56:14,805 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-01-24 12:56:14,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:14,805 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-24 12:56:14,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:56:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-24 12:56:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 12:56:14,806 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:14,806 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:14,806 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:14,806 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-01-24 12:56:14,807 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:14,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:14,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:14,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:14,808 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:14,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:15,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:15,057 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-24 12:56:15,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:15,063 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:15,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:15,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:56:15,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:15,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:15,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:56:15,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:56:15,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:56:15,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:56:15,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:15,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:15,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 12:56:15,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 12:56:15,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 12:56:15,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:15,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:15,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:56:15,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 12:56:15,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-24 12:56:15,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 12:56:15,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:15,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:15,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 12:56:15,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 12:56:17,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-24 12:56:17,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:56:17,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:56:17,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 12:56:17,521 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:17,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:17,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:17,533 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-24 12:56:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:17,600 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:17,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 12:56:17,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:17,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-24 12:56:17,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 12:56:17,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:17,908 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:17,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:17,912 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:7 [2018-01-24 12:56:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:17,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:17,963 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-24 12:56:17,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:17,966 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:56:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:18,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:18,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:56:18,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:56:18,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:56:18,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:56:18,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 12:56:18,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:56:18,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:56:18,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:56:18,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 12:56:18,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:56:18,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:56:18,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-01-24 12:56:18,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 12:56:18,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:56:18,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:18,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:56:18,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-01-24 12:56:30,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-01-24 12:56:30,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-24 12:56:30,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:30,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:56:30,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:56:30,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:30,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:30,957 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:30 [2018-01-24 12:56:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:31,134 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:31,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 12:56:31,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:56:31,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:31,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:31,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:31,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-01-24 12:56:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:31,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:56:31,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 11, 15, 12] total 56 [2018-01-24 12:56:31,644 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:56:31,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 12:56:31,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 12:56:31,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2976, Unknown=6, NotChecked=0, Total=3192 [2018-01-24 12:56:31,645 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 27 states. [2018-01-24 12:56:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:38,734 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-01-24 12:56:38,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 12:56:38,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-01-24 12:56:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:38,735 INFO L225 Difference]: With dead ends: 82 [2018-01-24 12:56:38,735 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 12:56:38,736 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 96 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=389, Invalid=4296, Unknown=7, NotChecked=0, Total=4692 [2018-01-24 12:56:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 12:56:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-01-24 12:56:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 12:56:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-24 12:56:38,745 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-01-24 12:56:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:38,745 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-24 12:56:38,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 12:56:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-24 12:56:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 12:56:38,746 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:38,746 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:38,746 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:38,746 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-01-24 12:56:38,746 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:38,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:38,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:38,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:38,747 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:38,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:38,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:38,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:56:38,871 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:38,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:56:38,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:56:38,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:56:38,872 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 7 states. [2018-01-24 12:56:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:39,037 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-01-24 12:56:39,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:56:39,038 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-24 12:56:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:39,039 INFO L225 Difference]: With dead ends: 79 [2018-01-24 12:56:39,039 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 12:56:39,039 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:56:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 12:56:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-24 12:56:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-24 12:56:39,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-01-24 12:56:39,052 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 39 [2018-01-24 12:56:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:39,053 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-01-24 12:56:39,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:56:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-01-24 12:56:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 12:56:39,053 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:39,054 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:39,054 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:39,054 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-01-24 12:56:39,054 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:39,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:39,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:39,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:39,055 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:39,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:39,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:39,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:56:39,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:56:39,177 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:56:39,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:56:39,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:56:39,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:56:39,178 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 8 states. [2018-01-24 12:56:39,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:56:39,321 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2018-01-24 12:56:39,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:56:39,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-01-24 12:56:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:56:39,322 INFO L225 Difference]: With dead ends: 152 [2018-01-24 12:56:39,322 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 12:56:39,323 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:56:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 12:56:39,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-01-24 12:56:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-24 12:56:39,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-01-24 12:56:39,339 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2018-01-24 12:56:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:56:39,340 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-01-24 12:56:39,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:56:39,340 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-01-24 12:56:39,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 12:56:39,341 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:56:39,341 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:56:39,341 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:56:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-01-24 12:56:39,341 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:56:39,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:39,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:56:39,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:56:39,342 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:56:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:56:39,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:56:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:39,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:39,735 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-24 12:56:39,740 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:56:39,740 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:56:39,754 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:56:39,759 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:56:39,761 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:56:39,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:39,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:56:39,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:39,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:56:39,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:39,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:39,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:56:39,830 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:56:39,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:56:39,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:56:39,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:39,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 12:56:39,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:39,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:39,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 12:56:39,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:56:39,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:56:39,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:39,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:39,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:56:39,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-24 12:56:39,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-01-24 12:56:39,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:56:39,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:39,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:39,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 12:56:39,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-24 12:56:41,671 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-24 12:56:41,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-24 12:56:41,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:56:41,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-24 12:56:41,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:41,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:41,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:41,719 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-24 12:56:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:41,811 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:42,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-24 12:56:42,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 12:56:42,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:42,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-01-24 12:56:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:43,478 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:56:43,478 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-24 12:56:43,483 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:56:43,483 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:56:43,513 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:56:43,549 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:56:43,599 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:56:43,604 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:56:43,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:56:43,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:56:43,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 12:56:43,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:56:43,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 12:56:43,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,677 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:56:43,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:56:43,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 12:56:43,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-24 12:56:43,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 12:56:43,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 12:56:43,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:56:43,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-01-24 12:56:43,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 12:56:43,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:43,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:56:43,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-24 12:56:45,853 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-24 12:56:45,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-24 12:56:45,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:56:45,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-01-24 12:56:45,871 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:45,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:45,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:45,935 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-24 12:56:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:45,944 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:56:52,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-24 12:56:52,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 12:56:52,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:56:52,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:56:52,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:56:52,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-24 12:56:55,010 WARN L143 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 12:56:57,237 WARN L143 SmtUtils]: Spent 2017ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-24 12:56:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:56:57,253 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:56:57,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 14, 17, 14] total 51 [2018-01-24 12:56:57,254 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:56:57,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 12:56:57,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 12:56:57,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2465, Unknown=3, NotChecked=0, Total=2652 [2018-01-24 12:56:57,255 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 30 states. [2018-01-24 12:56:58,221 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 55 DAG size of output 39 [2018-01-24 12:57:01,024 WARN L146 SmtUtils]: Spent 2127ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-01-24 12:57:01,346 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 61 DAG size of output 47 [2018-01-24 12:57:02,117 WARN L146 SmtUtils]: Spent 370ms on a formula simplification. DAG size of input: 68 DAG size of output 52 [2018-01-24 12:57:02,371 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-01-24 12:57:02,562 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 78 DAG size of output 58 [2018-01-24 12:57:02,964 WARN L146 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 54 DAG size of output 43 [2018-01-24 12:57:04,024 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 58 DAG size of output 47 [2018-01-24 12:57:04,466 WARN L146 SmtUtils]: Spent 349ms on a formula simplification. DAG size of input: 68 DAG size of output 53 [2018-01-24 12:57:04,917 WARN L146 SmtUtils]: Spent 348ms on a formula simplification. DAG size of input: 72 DAG size of output 57 [2018-01-24 12:57:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:57:06,434 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-24 12:57:06,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 12:57:06,435 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2018-01-24 12:57:06,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:57:06,436 INFO L225 Difference]: With dead ends: 113 [2018-01-24 12:57:06,436 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 12:57:06,437 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 119 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=504, Invalid=4049, Unknown=3, NotChecked=0, Total=4556 [2018-01-24 12:57:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 12:57:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2018-01-24 12:57:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 12:57:06,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-01-24 12:57:06,444 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 41 [2018-01-24 12:57:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:57:06,444 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-01-24 12:57:06,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 12:57:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-01-24 12:57:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 12:57:06,445 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:57:06,445 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:57:06,445 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:57:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash 648064035, now seen corresponding path program 1 times [2018-01-24 12:57:06,445 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:57:06,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:06,446 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:57:06,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:06,446 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:57:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:06,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:57:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:57:06,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:57:06,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 12:57:06,742 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:57:06,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:57:06,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:57:06,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:57:06,743 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 16 states. [2018-01-24 12:57:07,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:57:07,167 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-01-24 12:57:07,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:57:07,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-01-24 12:57:07,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:57:07,168 INFO L225 Difference]: With dead ends: 121 [2018-01-24 12:57:07,168 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 12:57:07,169 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-01-24 12:57:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 12:57:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2018-01-24 12:57:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-24 12:57:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2018-01-24 12:57:07,184 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 43 [2018-01-24 12:57:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:57:07,185 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2018-01-24 12:57:07,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:57:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2018-01-24 12:57:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 12:57:07,185 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:57:07,186 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:57:07,186 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:57:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash 19279971, now seen corresponding path program 1 times [2018-01-24 12:57:07,186 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:57:07,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:07,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:07,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:07,187 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:57:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:07,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:57:07,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:07,254 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:57:07,254 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-24 12:57:07,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:07,259 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:57:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:07,280 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:57:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:57:07,318 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:57:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:57:07,350 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:57:07,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [8] total 11 [2018-01-24 12:57:07,351 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:57:07,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:57:07,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:57:07,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:57:07,351 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 9 states. [2018-01-24 12:57:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:57:07,452 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-01-24 12:57:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:57:07,453 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-01-24 12:57:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:57:07,454 INFO L225 Difference]: With dead ends: 98 [2018-01-24 12:57:07,454 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 12:57:07,455 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:57:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 12:57:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-01-24 12:57:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-24 12:57:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2018-01-24 12:57:07,469 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 45 [2018-01-24 12:57:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:57:07,469 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2018-01-24 12:57:07,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:57:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2018-01-24 12:57:07,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 12:57:07,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:57:07,470 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:57:07,470 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:57:07,471 INFO L82 PathProgramCache]: Analyzing trace with hash 19279972, now seen corresponding path program 1 times [2018-01-24 12:57:07,471 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:57:07,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:07,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:07,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:07,472 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:57:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:07,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:57:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:07,808 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:57:07,809 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:57:07,814 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:07,814 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:57:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:07,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:57:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:07,986 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:57:08,107 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 12:57:08,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:08,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-01-24 12:57:08,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:08,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:08,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:3 [2018-01-24 12:57:08,162 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-24 12:57:08,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-24 12:57:08,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:57:08,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:17 [2018-01-24 12:57:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:08,279 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:57:08,279 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:57:08,285 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:08,285 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:57:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:08,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:57:08,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:57:08,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:57:08,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:57:08,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:1 [2018-01-24 12:57:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:08,366 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:57:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:57:09,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-01-24 12:57:09,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14, 10, 10, 10] total 36 [2018-01-24 12:57:09,033 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:57:09,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:57:09,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:57:09,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1186, Unknown=0, NotChecked=0, Total=1332 [2018-01-24 12:57:09,034 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 11 states. [2018-01-24 12:57:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:57:09,178 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2018-01-24 12:57:09,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:57:09,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-01-24 12:57:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:57:09,180 INFO L225 Difference]: With dead ends: 110 [2018-01-24 12:57:09,180 INFO L226 Difference]: Without dead ends: 109 [2018-01-24 12:57:09,180 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=1328, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 12:57:09,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-24 12:57:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-01-24 12:57:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-24 12:57:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-01-24 12:57:09,194 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 45 [2018-01-24 12:57:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:57:09,194 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-01-24 12:57:09,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:57:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-01-24 12:57:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:57:09,195 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:57:09,195 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:57:09,195 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:57:09,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184644, now seen corresponding path program 1 times [2018-01-24 12:57:09,195 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:57:09,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:09,196 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:09,196 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:09,196 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:57:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:09,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:57:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:57:09,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:57:09,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:57:09,287 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:57:09,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:57:09,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:57:09,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:57:09,288 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 8 states. [2018-01-24 12:57:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:57:09,393 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2018-01-24 12:57:09,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:57:09,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-01-24 12:57:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:57:09,394 INFO L225 Difference]: With dead ends: 101 [2018-01-24 12:57:09,395 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 12:57:09,395 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:57:09,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 12:57:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-01-24 12:57:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-24 12:57:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2018-01-24 12:57:09,411 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 47 [2018-01-24 12:57:09,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:57:09,411 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2018-01-24 12:57:09,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:57:09,411 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2018-01-24 12:57:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:57:09,412 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:57:09,412 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:57:09,412 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-24 12:57:09,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184645, now seen corresponding path program 1 times [2018-01-24 12:57:09,412 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:57:09,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:09,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:57:09,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:57:09,413 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:57:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:57:09,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:57:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 12:57:09,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:57:09,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:57:09,468 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:57:09,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:57:09,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:57:09,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:57:09,469 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand 5 states. Received shutdown request... [2018-01-24 12:57:09,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 12:57:09,490 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:57:09,497 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:57:09,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:57:09 BoogieIcfgContainer [2018-01-24 12:57:09,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:57:09,499 INFO L168 Benchmark]: Toolchain (without parser) took 63161.90 ms. Allocated memory was 299.4 MB in the beginning and 591.9 MB in the end (delta: 292.6 MB). Free memory was 259.4 MB in the beginning and 423.4 MB in the end (delta: -164.0 MB). Peak memory consumption was 128.5 MB. Max. memory is 5.3 GB. [2018-01-24 12:57:09,500 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:57:09,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.25 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 248.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:57:09,501 INFO L168 Benchmark]: Boogie Preprocessor took 39.59 ms. Allocated memory is still 299.4 MB. Free memory was 247.3 MB in the beginning and 246.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-24 12:57:09,501 INFO L168 Benchmark]: RCFGBuilder took 375.40 ms. Allocated memory is still 299.4 MB. Free memory was 246.3 MB in the beginning and 220.7 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:57:09,501 INFO L168 Benchmark]: TraceAbstraction took 62523.00 ms. Allocated memory was 299.4 MB in the beginning and 591.9 MB in the end (delta: 292.6 MB). Free memory was 219.7 MB in the beginning and 423.4 MB in the end (delta: -203.7 MB). Peak memory consumption was 88.8 MB. Max. memory is 5.3 GB. [2018-01-24 12:57:09,503 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.17 ms. Allocated memory is still 299.4 MB. Free memory is still 265.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.25 ms. Allocated memory is still 299.4 MB. Free memory was 258.4 MB in the beginning and 248.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.59 ms. Allocated memory is still 299.4 MB. Free memory was 247.3 MB in the beginning and 246.3 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 375.40 ms. Allocated memory is still 299.4 MB. Free memory was 246.3 MB in the beginning and 220.7 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 62523.00 ms. Allocated memory was 299.4 MB in the beginning and 591.9 MB in the end (delta: 292.6 MB). Free memory was 219.7 MB in the beginning and 423.4 MB in the end (delta: -203.7 MB). Peak memory consumption was 88.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (100states) and interpolant automaton (currently 2 states, 5 states before enhancement), while ReachableStatesComputation was computing reachable states (23 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 62.4s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 21.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1629 SDtfs, 1397 SDslu, 7763 SDs, 0 SdLazy, 4592 SolverSat, 290 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1010 GetRequests, 568 SyntacticMatches, 26 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3340 ImplicationChecksByTransitivity, 47.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 140 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 39.8s InterpolantComputationTime, 1058 NumberOfCodeBlocks, 1058 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1359 ConstructedInterpolants, 153 QuantifiedInterpolants, 481619 SizeOfPredicates, 139 NumberOfNonLiveVariables, 1531 ConjunctsInSsa, 323 ConjunctsInUnsatCore, 42 InterpolantComputations, 22 PerfectInterpolantSequences, 30/100 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-57-09-512.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-57-09-512.csv Completed graceful shutdown