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_preciseopt.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-25 02:41:55,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:41:55,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:41:55,555 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:41:55,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:41:55,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:41:55,558 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:41:55,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:41:55,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:41:55,562 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:41:55,563 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:41:55,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:41:55,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:41:55,566 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:41:55,567 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:41:55,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:41:55,572 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:41:55,573 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:41:55,575 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:41:55,576 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:41:55,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:41:55,579 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:41:55,579 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:41:55,580 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:41:55,581 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:41:55,582 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:41:55,582 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:41:55,583 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:41:55,583 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:41:55,583 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:41:55,584 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:41:55,584 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_preciseopt.epf [2018-01-25 02:41:55,594 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:41:55,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:41:55,595 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:41:55,595 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:41:55,595 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:41:55,596 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:41:55,596 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:41:55,596 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:41:55,596 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:41:55,597 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:41:55,597 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:41:55,597 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:41:55,597 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:41:55,598 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:41:55,598 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:41:55,598 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:41:55,598 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:41:55,598 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:41:55,599 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:41:55,599 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:41:55,599 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:41:55,599 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:41:55,599 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:41:55,600 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:41:55,600 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:41:55,600 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:41:55,600 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:41:55,601 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:41:55,601 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:41:55,601 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:41:55,601 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:41:55,601 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:41:55,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:41:55,602 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:41:55,602 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:41:55,603 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:41:55,603 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:41:55,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:41:55,659 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:41:55,663 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:41:55,665 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:41:55,667 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:41:55,667 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-25 02:41:55,889 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:41:55,894 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:41:55,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:41:55,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:41:55,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:41:55,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:41:55" (1/1) ... [2018-01-25 02:41:55,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfe6cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:55, skipping insertion in model container [2018-01-25 02:41:55,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:41:55" (1/1) ... [2018-01-25 02:41:55,917 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:41:55,978 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:41:56,096 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:41:56,113 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:41:56,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:56 WrapperNode [2018-01-25 02:41:56,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:41:56,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:41:56,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:41:56,123 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:41:56,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:56" (1/1) ... [2018-01-25 02:41:56,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:56" (1/1) ... [2018-01-25 02:41:56,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:56" (1/1) ... [2018-01-25 02:41:56,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:56" (1/1) ... [2018-01-25 02:41:56,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:56" (1/1) ... [2018-01-25 02:41:56,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:56" (1/1) ... [2018-01-25 02:41:56,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:56" (1/1) ... [2018-01-25 02:41:56,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:41:56,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:41:56,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:41:56,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:41:56,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:41:56,217 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:41:56,218 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:41:56,218 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-25 02:41:56,218 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:41:56,218 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:41:56,218 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:41:56,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:41:56,219 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:41:56,219 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:41:56,219 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:41:56,219 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-25 02:41:56,219 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:41:56,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:41:56,220 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:41:56,445 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:41:56,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:41:56 BoogieIcfgContainer [2018-01-25 02:41:56,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:41:56,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:41:56,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:41:56,450 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:41:56,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:41:55" (1/3) ... [2018-01-25 02:41:56,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1276e19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:41:56, skipping insertion in model container [2018-01-25 02:41:56,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:41:56" (2/3) ... [2018-01-25 02:41:56,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1276e19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:41:56, skipping insertion in model container [2018-01-25 02:41:56,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:41:56" (3/3) ... [2018-01-25 02:41:56,453 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:41:56,460 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:41:56,466 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-25 02:41:56,515 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:41:56,515 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:41:56,515 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:41:56,515 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:41:56,516 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:41:56,516 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:41:56,516 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:41:56,516 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:41:56,517 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:41:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-01-25 02:41:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 02:41:56,547 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:56,548 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:56,548 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:56,554 INFO L82 PathProgramCache]: Analyzing trace with hash 967400660, now seen corresponding path program 1 times [2018-01-25 02:41:56,557 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:56,606 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:56,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:56,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:56,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:56,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:56,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:56,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 02:41:56,727 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:56,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:41:56,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:41:56,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:41:56,750 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-01-25 02:41:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:56,954 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-25 02:41:56,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:41:56,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-25 02:41:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:56,964 INFO L225 Difference]: With dead ends: 73 [2018-01-25 02:41:56,964 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 02:41:56,967 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-25 02:41:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 02:41:56,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 02:41:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 02:41:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-25 02:41:56,999 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2018-01-25 02:41:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:57,000 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-25 02:41:57,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:41:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-25 02:41:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:41:57,000 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:57,001 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:57,001 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837349, now seen corresponding path program 1 times [2018-01-25 02:41:57,001 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:57,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:57,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:57,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:57,003 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:57,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:57,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:57,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:57,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:41:57,101 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:57,103 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:41:57,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:41:57,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:41:57,104 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-01-25 02:41:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:57,204 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-01-25 02:41:57,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:41:57,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 02:41:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:57,206 INFO L225 Difference]: With dead ends: 47 [2018-01-25 02:41:57,206 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 02:41:57,207 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:41:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 02:41:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 02:41:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 02:41:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-25 02:41:57,215 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-01-25 02:41:57,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:57,215 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-25 02:41:57,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:41:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-25 02:41:57,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:41:57,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:57,217 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:57,217 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837350, now seen corresponding path program 1 times [2018-01-25 02:41:57,217 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:57,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:57,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:57,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:57,219 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:57,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:57,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:57,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:41:57,355 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:57,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:41:57,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:41:57,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:41:57,356 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-01-25 02:41:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:57,479 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-25 02:41:57,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:41:57,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-25 02:41:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:57,481 INFO L225 Difference]: With dead ends: 46 [2018-01-25 02:41:57,481 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 02:41:57,482 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-25 02:41:57,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 02:41:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-25 02:41:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 02:41:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-25 02:41:57,493 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-01-25 02:41:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:57,493 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-25 02:41:57,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:41:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-25 02:41:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:41:57,494 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:57,494 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:57,494 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:57,494 INFO L82 PathProgramCache]: Analyzing trace with hash -346682393, now seen corresponding path program 1 times [2018-01-25 02:41:57,495 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:57,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:57,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:57,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:57,496 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:57,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:57,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:57,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:41:57,578 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:57,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:41:57,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:41:57,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:41:57,579 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 4 states. [2018-01-25 02:41:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:57,680 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-25 02:41:57,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:41:57,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-25 02:41:57,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:57,682 INFO L225 Difference]: With dead ends: 45 [2018-01-25 02:41:57,682 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 02:41:57,683 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:41:57,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 02:41:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 02:41:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 02:41:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-25 02:41:57,690 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 16 [2018-01-25 02:41:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:57,690 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-25 02:41:57,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:41:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-25 02:41:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:41:57,692 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:57,692 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:57,692 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:57,692 INFO L82 PathProgramCache]: Analyzing trace with hash -346682392, now seen corresponding path program 1 times [2018-01-25 02:41:57,693 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:57,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:57,694 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:57,694 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:57,694 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:57,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:57,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:57,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:41:57,816 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:57,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:41:57,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:41:57,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:41:57,817 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-25 02:41:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:57,942 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-25 02:41:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:41:57,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-25 02:41:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:57,946 INFO L225 Difference]: With dead ends: 60 [2018-01-25 02:41:57,946 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 02:41:57,947 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-25 02:41:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 02:41:57,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-01-25 02:41:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:41:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-25 02:41:57,961 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2018-01-25 02:41:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:57,962 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-25 02:41:57,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:41:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-25 02:41:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 02:41:57,963 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:57,964 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:57,964 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1156029018, now seen corresponding path program 1 times [2018-01-25 02:41:57,964 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:57,965 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:57,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:57,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:57,966 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:57,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:58,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:58,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:41:58,076 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:58,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:41:58,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:41:58,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:41:58,077 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2018-01-25 02:41:58,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:58,183 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-25 02:41:58,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:41:58,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-25 02:41:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:58,184 INFO L225 Difference]: With dead ends: 51 [2018-01-25 02:41:58,185 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:41:58,185 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:41:58,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:41:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-25 02:41:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 02:41:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-25 02:41:58,191 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-01-25 02:41:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:58,192 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-25 02:41:58,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:41:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-25 02:41:58,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:41:58,193 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:58,193 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:58,193 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:58,194 INFO L82 PathProgramCache]: Analyzing trace with hash -131455439, now seen corresponding path program 1 times [2018-01-25 02:41:58,194 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:58,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:58,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:58,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:58,195 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:58,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:58,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:58,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:41:58,239 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:58,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:41:58,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:41:58,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:41:58,240 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-25 02:41:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:58,284 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-01-25 02:41:58,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:41:58,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 02:41:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:58,290 INFO L225 Difference]: With dead ends: 43 [2018-01-25 02:41:58,290 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 02:41:58,290 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:41:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 02:41:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-25 02:41:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 02:41:58,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-25 02:41:58,295 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-01-25 02:41:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:58,295 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-25 02:41:58,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:41:58,295 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-25 02:41:58,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:41:58,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:58,296 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:58,296 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:58,296 INFO L82 PathProgramCache]: Analyzing trace with hash -131455438, now seen corresponding path program 1 times [2018-01-25 02:41:58,296 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:58,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:58,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:58,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:58,302 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:58,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:58,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:58,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:41:58,407 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:58,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:41:58,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:41:58,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:41:58,408 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-01-25 02:41:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:58,569 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-25 02:41:58,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:41:58,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-25 02:41:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:58,570 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:41:58,570 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:41:58,570 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-25 02:41:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:41:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-01-25 02:41:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 02:41:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-25 02:41:58,575 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 20 [2018-01-25 02:41:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:58,575 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-25 02:41:58,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:41:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-25 02:41:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:41:58,575 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:58,576 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:58,576 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:58,576 INFO L82 PathProgramCache]: Analyzing trace with hash -313436100, now seen corresponding path program 1 times [2018-01-25 02:41:58,576 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:58,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:58,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:58,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:58,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:58,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:58,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:58,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:41:58,631 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:58,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:41:58,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:41:58,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:41:58,632 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-25 02:41:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:58,693 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-25 02:41:58,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:41:58,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 02:41:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:58,694 INFO L225 Difference]: With dead ends: 44 [2018-01-25 02:41:58,694 INFO L226 Difference]: Without dead ends: 43 [2018-01-25 02:41:58,695 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:41:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-25 02:41:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-25 02:41:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 02:41:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-25 02:41:58,700 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-01-25 02:41:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:58,701 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-25 02:41:58,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:41:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-25 02:41:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:41:58,702 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:58,703 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:41:58,703 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:58,704 INFO L82 PathProgramCache]: Analyzing trace with hash -313436099, now seen corresponding path program 1 times [2018-01-25 02:41:58,704 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:58,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:58,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:58,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:58,705 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:58,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:58,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:41:58,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:41:58,841 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:41:58,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:41:58,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:41:58,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:41:58,842 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-01-25 02:41:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:41:59,050 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-25 02:41:59,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 02:41:59,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-25 02:41:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:41:59,051 INFO L225 Difference]: With dead ends: 51 [2018-01-25 02:41:59,051 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:41:59,052 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-25 02:41:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:41:59,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-01-25 02:41:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 02:41:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-25 02:41:59,058 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-01-25 02:41:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:41:59,058 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-25 02:41:59,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:41:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-25 02:41:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:41:59,059 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:41:59,059 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-25 02:41:59,060 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:41:59,060 INFO L82 PathProgramCache]: Analyzing trace with hash -313382859, now seen corresponding path program 1 times [2018-01-25 02:41:59,060 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:41:59,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:59,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:41:59,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:41:59,061 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:41:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:41:59,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:41:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:41:59,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:41:59,166 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:41:59,167 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 02:41:59,169 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-25 02:41:59,230 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:41:59,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:42:36,699 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:42:36,701 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-25 02:42:36,710 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:42:36,710 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:42:36,710 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:42:36,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:36,727 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:42:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:36,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:42:36,858 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-25 02:42:36,863 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-25 02:42:36,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:42:36,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:42:36,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:42:36,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-25 02:42:36,903 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-25 02:42:36,905 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-25 02:42:36,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:42:36,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:42:36,907 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-25 02:42:36,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-25 02:42:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:42:36,916 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:42:36,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:42:36,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:42:36,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:42:36,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:42:36,951 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-25 02:42:36,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-25 02:42:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:42:36,978 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 02:42:36,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [7] total 13 [2018-01-25 02:42:36,979 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:36,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:42:36,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:42:36,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:42:36,980 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 7 states. [2018-01-25 02:42:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:37,145 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-01-25 02:42:37,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:42:37,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-25 02:42:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:37,147 INFO L225 Difference]: With dead ends: 97 [2018-01-25 02:42:37,147 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 02:42:37,148 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-01-25 02:42:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 02:42:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2018-01-25 02:42:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 02:42:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-01-25 02:42:37,156 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 24 [2018-01-25 02:42:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:37,157 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-01-25 02:42:37,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:42:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-01-25 02:42:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:42:37,162 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:37,162 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-25 02:42:37,162 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1334451213, now seen corresponding path program 1 times [2018-01-25 02:42:37,162 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:37,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:37,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:37,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:37,163 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:37,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:42:37,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:42:37,374 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:42:37,375 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 02:42:37,375 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-25 02:42:37,378 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:42:37,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:42:52,693 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:42:52,693 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:42:52,694 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:42:52,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:42:52,694 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:42:52,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:52,701 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:42:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:52,727 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:42:52,729 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:42:52,730 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:42:52,733 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:42:52,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:42:52 BoogieIcfgContainer [2018-01-25 02:42:52,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:42:52,734 INFO L168 Benchmark]: Toolchain (without parser) took 56844.89 ms. Allocated memory was 304.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 263.0 MB in the beginning and 452.8 MB in the end (delta: -189.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-25 02:42:52,735 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:42:52,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.82 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:42:52,735 INFO L168 Benchmark]: Boogie Preprocessor took 39.28 ms. Allocated memory is still 304.1 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:42:52,736 INFO L168 Benchmark]: RCFGBuilder took 283.85 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 231.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. [2018-01-25 02:42:52,736 INFO L168 Benchmark]: TraceAbstraction took 56287.41 ms. Allocated memory was 304.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 231.9 MB in the beginning and 452.8 MB in the end (delta: -220.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-25 02:42:52,737 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.82 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 252.9 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.28 ms. Allocated memory is still 304.1 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 283.85 ms. Allocated memory is still 304.1 MB. Free memory was 250.9 MB in the beginning and 231.9 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 56287.41 ms. Allocated memory was 304.1 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 231.9 MB in the beginning and 452.8 MB in the end (delta: -220.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 5 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 269 LocStat_NO_SUPPORTING_DISEQUALITIES : 55 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.897846 RENAME_VARIABLES(MILLISECONDS) : 0.171169 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.845074 PROJECTAWAY(MILLISECONDS) : 0.355806 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.078579 DISJOIN(MILLISECONDS) : 0.332734 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.194555 ADD_EQUALITY(MILLISECONDS) : 0.019109 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010891 #CONJOIN_DISJUNCTIVE : 51 #RENAME_VARIABLES : 76 #UNFREEZE : 0 #CONJOIN : 96 #PROJECTAWAY : 69 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 73 #ADD_EQUALITY : 59 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 * 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 analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 25 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 11 error locations. TIMEOUT Result, 56.2s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 430 SDtfs, 377 SDslu, 949 SDs, 0 SdLazy, 528 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 52.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 36 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 17172 SizeOfPredicates, 10 NumberOfNonLiveVariables, 116 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 4/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-42-52-748.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-42-52-748.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-42-52-748.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-42-52-748.csv Completed graceful shutdown