java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:53:13,213 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:53:13,214 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:53:13,226 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:53:13,227 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:53:13,227 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:53:13,228 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:53:13,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:53:13,231 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:53:13,231 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:53:13,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:53:13,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:53:13,233 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:53:13,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:53:13,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:53:13,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:53:13,240 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:53:13,242 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:53:13,243 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:53:13,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:53:13,247 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:53:13,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:53:13,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:53:13,248 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:53:13,249 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:53:13,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:53:13,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:53:13,251 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:53:13,251 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:53:13,252 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:53:13,252 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:53:13,253 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-24 19:53:13,262 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:53:13,262 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:53:13,263 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:53:13,263 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:53:13,263 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:53:13,263 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:53:13,263 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:53:13,263 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:53:13,264 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:53:13,264 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:53:13,264 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:53:13,264 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:53:13,264 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:53:13,265 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:53:13,265 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:53:13,265 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:53:13,265 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:53:13,265 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:53:13,265 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:53:13,265 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:53:13,265 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:53:13,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:53:13,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:53:13,266 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:53:13,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:53:13,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:53:13,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:53:13,267 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:53:13,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:53:13,267 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:53:13,267 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:53:13,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:53:13,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:53:13,267 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:53:13,268 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:53:13,268 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:53:13,268 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:53:13,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:53:13,312 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:53:13,315 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:53:13,316 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:53:13,317 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:53:13,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:53:13,471 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:53:13,476 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:53:13,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:53:13,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:53:13,482 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:53:13,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:53:13" (1/1) ... [2018-01-24 19:53:13,486 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 07:53:13, skipping insertion in model container [2018-01-24 19:53:13,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:53:13" (1/1) ... [2018-01-24 19:53:13,499 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:53:13,536 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:53:13,658 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:53:13,679 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:53:13,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:13 WrapperNode [2018-01-24 19:53:13,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:53:13,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:53:13,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:53:13,689 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:53:13,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:13" (1/1) ... [2018-01-24 19:53:13,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:13" (1/1) ... [2018-01-24 19:53:13,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:13" (1/1) ... [2018-01-24 19:53:13,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:13" (1/1) ... [2018-01-24 19:53:13,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:13" (1/1) ... [2018-01-24 19:53:13,723 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:13" (1/1) ... [2018-01-24 19:53:13,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:13" (1/1) ... [2018-01-24 19:53:13,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:53:13,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:53:13,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:53:13,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:53:13,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:13" (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 19:53:13,787 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:53:13,788 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:53:13,788 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-24 19:53:13,788 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:53:13,788 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:53:13,788 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:53:13,788 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:53:13,788 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:53:13,788 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:53:13,788 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:53:13,788 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-24 19:53:13,789 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:53:13,789 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:53:13,789 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:53:13,996 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:53:13,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:53:13 BoogieIcfgContainer [2018-01-24 19:53:13,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:53:13,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:53:13,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:53:13,999 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:53:13,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:53:13" (1/3) ... [2018-01-24 19:53:14,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcdb59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:53:14, skipping insertion in model container [2018-01-24 19:53:14,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:53:13" (2/3) ... [2018-01-24 19:53:14,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcdb59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:53:14, skipping insertion in model container [2018-01-24 19:53:14,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:53:13" (3/3) ... [2018-01-24 19:53:14,004 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:53:14,010 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:53:14,016 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-24 19:53:14,059 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:53:14,059 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:53:14,059 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:53:14,059 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:53:14,059 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:53:14,059 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:53:14,059 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:53:14,059 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:53:14,060 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:53:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-01-24 19:53:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 19:53:14,086 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:14,087 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:14,087 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:14,091 INFO L82 PathProgramCache]: Analyzing trace with hash 967400660, now seen corresponding path program 1 times [2018-01-24 19:53:14,093 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:14,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:14,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:14,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:14,148 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:14,207 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:14,266 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 19:53:14,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:14,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 19:53:14,269 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:14,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 19:53:14,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 19:53:14,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 19:53:14,289 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-01-24 19:53:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:14,484 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 19:53:14,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 19:53:14,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 19:53:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:14,494 INFO L225 Difference]: With dead ends: 73 [2018-01-24 19:53:14,494 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 19:53:14,497 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 19:53:14,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 19:53:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 19:53:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 19:53:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-24 19:53:14,529 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2018-01-24 19:53:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:14,530 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-24 19:53:14,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 19:53:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-24 19:53:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 19:53:14,530 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:14,530 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:14,531 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837349, now seen corresponding path program 1 times [2018-01-24 19:53:14,531 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:14,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:14,532 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:14,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:14,533 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:14,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:14,625 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 19:53:14,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:14,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:53:14,626 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:14,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:53:14,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:53:14,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:53:14,629 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-01-24 19:53:14,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:14,699 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-01-24 19:53:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:53:14,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 19:53:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:14,700 INFO L225 Difference]: With dead ends: 47 [2018-01-24 19:53:14,701 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 19:53:14,702 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 19:53:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 19:53:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 19:53:14,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 19:53:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 19:53:14,708 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-01-24 19:53:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:14,708 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 19:53:14,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:53:14,709 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 19:53:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 19:53:14,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:14,709 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:14,710 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837350, now seen corresponding path program 1 times [2018-01-24 19:53:14,710 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:14,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:14,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:14,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:14,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:14,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:14,838 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 19:53:14,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:14,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:53:14,839 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:14,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:53:14,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:53:14,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:53:14,840 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-01-24 19:53:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:14,900 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-24 19:53:14,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:53:14,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 19:53:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:14,902 INFO L225 Difference]: With dead ends: 46 [2018-01-24 19:53:14,902 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 19:53:14,903 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 19:53:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 19:53:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 19:53:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 19:53:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-24 19:53:14,910 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-01-24 19:53:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:14,910 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-24 19:53:14,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:53:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-24 19:53:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 19:53:14,911 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:14,911 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:14,911 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:14,912 INFO L82 PathProgramCache]: Analyzing trace with hash -346682393, now seen corresponding path program 1 times [2018-01-24 19:53:14,912 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:14,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:14,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:14,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:14,913 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:14,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:14,958 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 19:53:14,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:14,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:53:14,958 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:14,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:53:14,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:53:14,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:53:14,959 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 4 states. [2018-01-24 19:53:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:15,047 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-24 19:53:15,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:53:15,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 19:53:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:15,049 INFO L225 Difference]: With dead ends: 45 [2018-01-24 19:53:15,049 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 19:53:15,050 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 19:53:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 19:53:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 19:53:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 19:53:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 19:53:15,056 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 16 [2018-01-24 19:53:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:15,056 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 19:53:15,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:53:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 19:53:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 19:53:15,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:15,057 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:15,057 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:15,058 INFO L82 PathProgramCache]: Analyzing trace with hash -346682392, now seen corresponding path program 1 times [2018-01-24 19:53:15,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:15,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:15,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:15,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:15,132 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 19:53:15,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:15,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:53:15,133 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:15,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:53:15,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:53:15,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:53:15,133 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 19:53:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:15,237 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-24 19:53:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 19:53:15,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 19:53:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:15,240 INFO L225 Difference]: With dead ends: 60 [2018-01-24 19:53:15,240 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 19:53:15,240 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:53:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 19:53:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-01-24 19:53:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 19:53:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-24 19:53:15,252 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2018-01-24 19:53:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:15,252 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-24 19:53:15,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:53:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-24 19:53:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 19:53:15,253 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:15,253 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:15,253 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:15,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1156029018, now seen corresponding path program 1 times [2018-01-24 19:53:15,253 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:15,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:15,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,254 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:15,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:15,350 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 19:53:15,350 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:15,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 19:53:15,350 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:15,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 19:53:15,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 19:53:15,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:53:15,352 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2018-01-24 19:53:15,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:15,449 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-24 19:53:15,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:53:15,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-24 19:53:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:15,451 INFO L225 Difference]: With dead ends: 51 [2018-01-24 19:53:15,451 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 19:53:15,451 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-24 19:53:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 19:53:15,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-24 19:53:15,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 19:53:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 19:53:15,457 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-01-24 19:53:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:15,458 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 19:53:15,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 19:53:15,458 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 19:53:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:53:15,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:15,459 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:15,459 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:15,459 INFO L82 PathProgramCache]: Analyzing trace with hash -131455439, now seen corresponding path program 1 times [2018-01-24 19:53:15,459 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:15,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:15,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,461 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:15,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 19:53:15,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:15,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:53:15,500 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:15,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:53:15,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:53:15,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:53:15,501 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-24 19:53:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:15,541 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-01-24 19:53:15,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:53:15,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 19:53:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:15,542 INFO L225 Difference]: With dead ends: 43 [2018-01-24 19:53:15,542 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 19:53:15,543 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 19:53:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 19:53:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 19:53:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 19:53:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 19:53:15,551 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-01-24 19:53:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:15,552 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 19:53:15,552 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:53:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 19:53:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 19:53:15,553 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:15,553 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:15,553 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:15,553 INFO L82 PathProgramCache]: Analyzing trace with hash -131455438, now seen corresponding path program 1 times [2018-01-24 19:53:15,553 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:15,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,554 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:15,554 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,554 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:15,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:15,648 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 19:53:15,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:15,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 19:53:15,648 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:15,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 19:53:15,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 19:53:15,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 19:53:15,649 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-01-24 19:53:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:15,773 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 19:53:15,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:53:15,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 19:53:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:15,799 INFO L225 Difference]: With dead ends: 49 [2018-01-24 19:53:15,799 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 19:53:15,800 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-24 19:53:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 19:53:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-01-24 19:53:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 19:53:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 19:53:15,805 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 20 [2018-01-24 19:53:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:15,806 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 19:53:15,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 19:53:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 19:53:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 19:53:15,807 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:15,807 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:15,807 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:15,807 INFO L82 PathProgramCache]: Analyzing trace with hash -313436100, now seen corresponding path program 1 times [2018-01-24 19:53:15,807 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:15,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:15,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,809 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:15,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:15,886 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 19:53:15,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:15,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:53:15,887 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:15,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:53:15,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:53:15,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:53:15,888 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 19:53:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:15,956 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-24 19:53:15,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:53:15,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 19:53:15,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:15,957 INFO L225 Difference]: With dead ends: 44 [2018-01-24 19:53:15,957 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 19:53:15,958 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 19:53:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 19:53:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 19:53:15,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 19:53:15,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 19:53:15,963 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-01-24 19:53:15,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:15,964 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 19:53:15,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:53:15,964 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 19:53:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 19:53:15,965 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:15,965 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:15,965 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:15,966 INFO L82 PathProgramCache]: Analyzing trace with hash -313436099, now seen corresponding path program 1 times [2018-01-24 19:53:15,966 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:15,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:15,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:15,967 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:15,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:16,117 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 19:53:16,118 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:53:16,118 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:53:16,118 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:16,118 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:53:16,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:53:16,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:53:16,119 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-01-24 19:53:16,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:16,291 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 19:53:16,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:53:16,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 19:53:16,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:16,292 INFO L225 Difference]: With dead ends: 51 [2018-01-24 19:53:16,292 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 19:53:16,293 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 19:53:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 19:53:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-01-24 19:53:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 19:53:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 19:53:16,299 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-01-24 19:53:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:16,299 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 19:53:16,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:53:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 19:53:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 19:53:16,300 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:16,301 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:16,301 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:16,301 INFO L82 PathProgramCache]: Analyzing trace with hash -313382859, now seen corresponding path program 1 times [2018-01-24 19:53:16,301 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:16,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:16,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:16,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:16,302 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:16,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:16,388 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 19:53:16,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:53:16,388 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:53:16,389 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 19:53:16,391 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [16], [44], [49], [53], [59], [66], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 19:53:16,433 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:53:16,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:53:48,118 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:53:48,119 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-24 19:53:48,136 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:53:48,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:53:48,136 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 19:53:48,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:48,146 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:53:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:48,182 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:53:48,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 19:53:48,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:53:48,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:53:48,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:53:48,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:53:48,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 19:53:48,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-24 19:53:48,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 19:53:48,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:53:48,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:53:48,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:53:48,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-24 19:53:48,322 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 19:53:48,322 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:53:48,334 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 19:53:48,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 19:53:48,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:53:48,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:53:48,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:53:48,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-24 19:53:48,366 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 19:53:48,391 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 19:53:48,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 13 [2018-01-24 19:53:48,391 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:53:48,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 19:53:48,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 19:53:48,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 19:53:48,392 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 7 states. [2018-01-24 19:53:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:53:48,504 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-24 19:53:48,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 19:53:48,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-24 19:53:48,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:53:48,505 INFO L225 Difference]: With dead ends: 97 [2018-01-24 19:53:48,505 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 19:53:48,506 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-01-24 19:53:48,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 19:53:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2018-01-24 19:53:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 19:53:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-01-24 19:53:48,514 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 24 [2018-01-24 19:53:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:53:48,514 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-01-24 19:53:48,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 19:53:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-01-24 19:53:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 19:53:48,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:53:48,516 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:53:48,516 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 19:53:48,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1334451213, now seen corresponding path program 1 times [2018-01-24 19:53:48,516 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:53:48,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:48,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:53:48,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:53:48,518 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:53:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:53:48,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:53:48,667 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 19:53:48,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:53:48,668 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:53:48,668 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 19:53:48,668 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [16], [44], [49], [53], [61], [66], [67], [68], [69], [70], [71], [74], [85], [86], [87], [89] [2018-01-24 19:53:48,669 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:53:48,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown