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_precise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:19:40,647 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:19:40,649 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:19:40,663 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:19:40,664 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:19:40,664 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:19:40,665 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:19:40,666 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:19:40,669 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:19:40,670 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:19:40,671 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:19:40,671 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:19:40,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:19:40,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:19:40,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:19:40,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:19:40,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:19:40,681 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:19:40,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:19:40,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:19:40,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:19:40,687 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:19:40,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:19:40,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:19:40,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:19:40,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:19:40,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:19:40,691 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:19:40,692 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:19:40,692 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:19:40,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:19:40,693 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_precise.epf [2018-01-24 23:19:40,702 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:19:40,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:19:40,703 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:19:40,703 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:19:40,704 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:19:40,704 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:19:40,704 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:19:40,704 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:19:40,705 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:19:40,705 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:19:40,705 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:19:40,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:19:40,706 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:19:40,706 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:19:40,706 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:19:40,706 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:19:40,707 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:19:40,707 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:19:40,707 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:19:40,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:19:40,707 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:19:40,708 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:19:40,708 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:19:40,708 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:19:40,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:19:40,708 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:19:40,709 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:19:40,709 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:19:40,709 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:19:40,709 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:19:40,709 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:19:40,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:19:40,710 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:19:40,710 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:19:40,711 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:19:40,711 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:19:40,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:19:40,760 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:19:40,764 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:19:40,766 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:19:40,766 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:19:40,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:19:40,941 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:19:40,947 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:19:40,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:19:40,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:19:40,954 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:19:40,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:19:40" (1/1) ... [2018-01-24 23:19:40,958 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 11:19:40, skipping insertion in model container [2018-01-24 23:19:40,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:19:40" (1/1) ... [2018-01-24 23:19:40,979 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:19:41,022 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:19:41,145 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:19:41,162 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:19:41,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:19:41 WrapperNode [2018-01-24 23:19:41,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:19:41,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:19:41,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:19:41,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:19:41,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:19:41" (1/1) ... [2018-01-24 23:19:41,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:19:41" (1/1) ... [2018-01-24 23:19:41,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:19:41" (1/1) ... [2018-01-24 23:19:41,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:19:41" (1/1) ... [2018-01-24 23:19:41,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:19:41" (1/1) ... [2018-01-24 23:19:41,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:19:41" (1/1) ... [2018-01-24 23:19:41,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:19:41" (1/1) ... [2018-01-24 23:19:41,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:19:41,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:19:41,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:19:41,207 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:19:41,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:19:41" (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 23:19:41,260 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:19:41,260 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:19:41,260 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-01-24 23:19:41,260 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:19:41,260 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:19:41,260 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:19:41,260 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:19:41,260 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:19:41,261 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:19:41,261 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:19:41,261 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-01-24 23:19:41,261 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:19:41,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:19:41,261 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:19:41,509 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:19:41,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:19:41 BoogieIcfgContainer [2018-01-24 23:19:41,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:19:41,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:19:41,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:19:41,544 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:19:41,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:19:40" (1/3) ... [2018-01-24 23:19:41,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0e5e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:19:41, skipping insertion in model container [2018-01-24 23:19:41,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:19:41" (2/3) ... [2018-01-24 23:19:41,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0e5e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:19:41, skipping insertion in model container [2018-01-24 23:19:41,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:19:41" (3/3) ... [2018-01-24 23:19:41,548 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:19:41,555 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:19:41,562 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 23:19:41,607 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:19:41,608 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:19:41,608 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:19:41,608 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:19:41,608 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:19:41,608 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:19:41,608 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:19:41,608 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:19:41,609 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:19:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-01-24 23:19:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:19:41,636 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:41,637 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:41,637 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:41,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-01-24 23:19:41,643 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:41,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:41,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:41,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:41,687 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:41,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:41,858 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 23:19:41,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:41,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:19:41,861 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:41,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:19:41,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:19:41,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:19:41,883 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-01-24 23:19:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:42,096 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-01-24 23:19:42,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:19:42,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 23:19:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:42,111 INFO L225 Difference]: With dead ends: 79 [2018-01-24 23:19:42,111 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 23:19:42,115 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 23:19:42,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 23:19:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 23:19:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 23:19:42,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-01-24 23:19:42,157 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-01-24 23:19:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:42,157 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-01-24 23:19:42,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:19:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-01-24 23:19:42,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:19:42,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:42,159 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:42,159 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:42,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-01-24 23:19:42,159 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:42,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:42,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:42,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:42,161 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:42,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:42,365 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 23:19:42,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:42,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:19:42,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:42,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:19:42,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:19:42,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:19:42,369 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-01-24 23:19:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:42,466 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-01-24 23:19:42,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:19:42,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 23:19:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:42,468 INFO L225 Difference]: With dead ends: 51 [2018-01-24 23:19:42,468 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 23:19:42,469 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:19:42,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 23:19:42,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 23:19:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 23:19:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-01-24 23:19:42,475 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-01-24 23:19:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:42,475 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-01-24 23:19:42,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:19:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-01-24 23:19:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:19:42,476 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:42,476 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:42,476 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-01-24 23:19:42,476 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:42,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:42,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:42,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:42,478 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:42,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:42,521 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 23:19:42,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:42,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:19:42,522 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:42,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:19:42,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:19:42,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:19:42,522 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-01-24 23:19:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:42,659 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-01-24 23:19:42,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:19:42,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:19:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:42,661 INFO L225 Difference]: With dead ends: 50 [2018-01-24 23:19:42,661 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 23:19:42,662 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 23:19:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 23:19:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 23:19:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 23:19:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-01-24 23:19:42,669 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-01-24 23:19:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:42,669 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-01-24 23:19:42,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:19:42,669 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-01-24 23:19:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:19:42,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:42,670 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:42,670 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:42,670 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-01-24 23:19:42,670 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:42,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:42,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:42,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:42,671 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:42,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:42,757 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 23:19:42,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:42,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:19:42,757 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:42,757 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:19:42,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:19:42,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:19:42,758 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-01-24 23:19:42,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:42,796 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-01-24 23:19:42,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:19:42,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:19:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:42,797 INFO L225 Difference]: With dead ends: 49 [2018-01-24 23:19:42,798 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 23:19:42,798 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:19:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 23:19:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 23:19:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 23:19:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-01-24 23:19:42,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-01-24 23:19:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:42,805 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-01-24 23:19:42,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:19:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-01-24 23:19:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:19:42,806 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:42,806 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 23:19:42,807 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-01-24 23:19:42,807 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:42,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:42,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:42,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:42,808 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:42,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:42,872 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 23:19:42,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:42,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:19:42,873 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:42,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:19:42,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:19:42,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:19:42,874 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-01-24 23:19:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:42,943 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-01-24 23:19:42,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:19:42,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 23:19:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:42,945 INFO L225 Difference]: With dead ends: 48 [2018-01-24 23:19:42,945 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 23:19:42,945 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 23:19:42,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 23:19:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 23:19:42,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 23:19:42,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-01-24 23:19:42,950 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-01-24 23:19:42,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:42,951 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-01-24 23:19:42,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:19:42,951 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-01-24 23:19:42,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 23:19:42,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:42,952 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 23:19:42,952 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:42,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-01-24 23:19:42,952 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:42,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:42,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:42,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:42,953 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:42,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:43,089 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 23:19:43,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:43,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:19:43,090 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:43,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:19:43,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:19:43,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:19:43,093 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-01-24 23:19:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:43,246 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-24 23:19:43,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:19:43,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 23:19:43,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:43,250 INFO L225 Difference]: With dead ends: 63 [2018-01-24 23:19:43,250 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 23:19:43,251 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:19:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 23:19:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-24 23:19:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 23:19:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 23:19:43,258 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-01-24 23:19:43,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:43,259 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 23:19:43,259 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:19:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 23:19:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 23:19:43,260 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:43,260 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] [2018-01-24 23:19:43,260 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-01-24 23:19:43,261 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:43,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:43,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:43,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:43,262 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:43,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:43,321 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 23:19:43,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:43,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:19:43,322 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:43,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:19:43,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:19:43,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:19:43,323 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 23:19:43,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:43,415 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 23:19:43,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:19:43,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 23:19:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:43,418 INFO L225 Difference]: With dead ends: 53 [2018-01-24 23:19:43,418 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 23:19:43,419 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 23:19:43,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 23:19:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 23:19:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 23:19:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 23:19:43,424 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-01-24 23:19:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:43,424 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 23:19:43,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:19:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 23:19:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 23:19:43,425 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:43,425 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] [2018-01-24 23:19:43,425 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:43,426 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-01-24 23:19:43,426 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:43,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:43,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:43,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:43,427 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:43,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:43,585 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 23:19:43,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:43,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:19:43,586 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:43,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:19:43,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:19:43,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:19:43,587 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 23:19:43,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:43,769 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-01-24 23:19:43,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:19:43,769 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 23:19:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:43,770 INFO L225 Difference]: With dead ends: 63 [2018-01-24 23:19:43,770 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 23:19:43,771 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:19:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 23:19:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-01-24 23:19:43,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 23:19:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 23:19:43,778 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-01-24 23:19:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:43,778 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 23:19:43,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:19:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 23:19:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:19:43,779 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:43,780 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:43,780 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:43,780 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-01-24 23:19:43,780 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:43,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:43,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:43,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:43,782 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:43,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:43,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:43,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:19:43,837 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:43,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:19:43,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:19:43,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:19:43,838 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 23:19:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:43,916 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 23:19:43,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:19:43,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 23:19:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:43,917 INFO L225 Difference]: With dead ends: 53 [2018-01-24 23:19:43,918 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 23:19:43,918 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 23:19:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 23:19:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 23:19:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 23:19:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 23:19:43,923 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-24 23:19:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:43,924 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 23:19:43,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:19:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 23:19:43,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:19:43,925 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:43,925 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:43,925 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:43,926 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-01-24 23:19:43,926 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:43,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:43,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:43,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:43,927 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:43,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:44,077 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 23:19:44,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:44,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:19:44,078 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:44,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:19:44,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:19:44,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:19:44,079 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 23:19:44,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:44,293 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-01-24 23:19:44,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:19:44,293 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 23:19:44,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:44,294 INFO L225 Difference]: With dead ends: 64 [2018-01-24 23:19:44,294 INFO L226 Difference]: Without dead ends: 63 [2018-01-24 23:19:44,295 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 23:19:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-24 23:19:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-01-24 23:19:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 23:19:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-01-24 23:19:44,300 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-01-24 23:19:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:44,301 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-01-24 23:19:44,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:19:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-01-24 23:19:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:19:44,302 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:44,302 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:44,302 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:44,303 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-01-24 23:19:44,303 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:44,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:44,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:44,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:44,304 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:44,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:44,346 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 23:19:44,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:44,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:19:44,347 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:44,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:19:44,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:19:44,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:19:44,348 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-01-24 23:19:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:44,396 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 23:19:44,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:19:44,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 23:19:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:44,397 INFO L225 Difference]: With dead ends: 53 [2018-01-24 23:19:44,397 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 23:19:44,397 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 23:19:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 23:19:44,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 23:19:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 23:19:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-01-24 23:19:44,403 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-01-24 23:19:44,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:44,403 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-01-24 23:19:44,403 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:19:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-01-24 23:19:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:19:44,404 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:44,404 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:44,404 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:44,404 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-01-24 23:19:44,404 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:44,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:44,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:44,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:44,405 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:44,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:44,500 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 23:19:44,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:44,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:19:44,500 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:44,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:19:44,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:19:44,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:19:44,501 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-01-24 23:19:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:44,638 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-01-24 23:19:44,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:19:44,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-24 23:19:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:44,639 INFO L225 Difference]: With dead ends: 60 [2018-01-24 23:19:44,639 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 23:19:44,640 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:19:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 23:19:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-24 23:19:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 23:19:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-01-24 23:19:44,645 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-01-24 23:19:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:44,646 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-01-24 23:19:44,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:19:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-01-24 23:19:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 23:19:44,647 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:44,647 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:44,647 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:44,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-01-24 23:19:44,647 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:44,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:44,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:44,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:44,649 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:44,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:44,927 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 23:19:44,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:44,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 23:19:44,928 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:44,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 23:19:44,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 23:19:44,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:19:44,928 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 11 states. [2018-01-24 23:19:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:45,090 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2018-01-24 23:19:45,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 23:19:45,090 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-01-24 23:19:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:45,091 INFO L225 Difference]: With dead ends: 85 [2018-01-24 23:19:45,091 INFO L226 Difference]: Without dead ends: 84 [2018-01-24 23:19:45,091 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-01-24 23:19:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-24 23:19:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2018-01-24 23:19:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 23:19:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2018-01-24 23:19:45,097 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 26 [2018-01-24 23:19:45,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:45,097 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2018-01-24 23:19:45,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 23:19:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2018-01-24 23:19:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 23:19:45,099 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:45,099 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:45,099 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-01-24 23:19:45,099 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:45,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:45,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:45,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:45,100 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:45,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 23:19:45,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:45,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:19:45,190 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:45,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:19:45,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:19:45,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:19:45,190 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand 6 states. [2018-01-24 23:19:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:45,227 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-01-24 23:19:45,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:19:45,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-24 23:19:45,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:45,229 INFO L225 Difference]: With dead ends: 80 [2018-01-24 23:19:45,229 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 23:19:45,229 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:19:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 23:19:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-24 23:19:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 23:19:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-01-24 23:19:45,235 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 26 [2018-01-24 23:19:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:45,235 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-01-24 23:19:45,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:19:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-01-24 23:19:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 23:19:45,236 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:45,237 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:45,237 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-01-24 23:19:45,237 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:45,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:45,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:45,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:45,238 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:45,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:45,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:45,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 23:19:45,408 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:45,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 23:19:45,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 23:19:45,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:19:45,408 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 10 states. [2018-01-24 23:19:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:45,598 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2018-01-24 23:19:45,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 23:19:45,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-01-24 23:19:45,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:45,599 INFO L225 Difference]: With dead ends: 138 [2018-01-24 23:19:45,599 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 23:19:45,600 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-24 23:19:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 23:19:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-01-24 23:19:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 23:19:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-01-24 23:19:45,608 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 27 [2018-01-24 23:19:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:45,609 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-01-24 23:19:45,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 23:19:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-01-24 23:19:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 23:19:45,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:45,611 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:45,611 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash 505638783, now seen corresponding path program 1 times [2018-01-24 23:19:45,611 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:45,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:45,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:45,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:45,613 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:45,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 23:19:45,704 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:19:45,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:19:45,705 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:19:45,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:19:45,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:19:45,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:19:45,706 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 6 states. [2018-01-24 23:19:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:19:45,763 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2018-01-24 23:19:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:19:45,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-24 23:19:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:19:45,765 INFO L225 Difference]: With dead ends: 128 [2018-01-24 23:19:45,765 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 23:19:45,766 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:19:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 23:19:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-24 23:19:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-24 23:19:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 110 transitions. [2018-01-24 23:19:45,774 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 110 transitions. Word has length 27 [2018-01-24 23:19:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:19:45,774 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 110 transitions. [2018-01-24 23:19:45,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:19:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 110 transitions. [2018-01-24 23:19:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 23:19:45,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:19:45,775 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:19:45,776 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:19:45,776 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-01-24 23:19:45,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:19:45,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:45,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:19:45,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:19:45,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:19:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:19:45,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:19:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:19:45,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:19:45,968 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:19:45,969 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 23:19:45,970 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [9], [14], [15], [17], [18], [25], [65], [66], [70], [75], [81], [83], [84], [85], [86], [87], [90], [101], [102], [103], [105] [2018-01-24 23:19:46,013 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:19:46,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 23:20:33,917 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 23:20:33,918 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 23:20:33,919 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:20:33,919 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:20:33,919 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 23:20:33,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:20:33,926 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:20:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:20:33,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:20:33,977 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 23:20:33,977 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:20:33,982 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:20:33,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:20:33 BoogieIcfgContainer [2018-01-24 23:20:33,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:20:33,984 INFO L168 Benchmark]: Toolchain (without parser) took 53042.31 ms. Allocated memory was 305.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 265.7 MB in the beginning and 1.2 GB in the end (delta: -958.3 MB). Peak memory consumption was 494.5 MB. Max. memory is 5.3 GB. [2018-01-24 23:20:33,985 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:20:33,986 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.16 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 23:20:33,986 INFO L168 Benchmark]: Boogie Preprocessor took 37.25 ms. Allocated memory is still 305.7 MB. Free memory was 254.6 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:20:33,986 INFO L168 Benchmark]: RCFGBuilder took 334.35 ms. Allocated memory is still 305.7 MB. Free memory was 252.5 MB in the beginning and 232.9 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-24 23:20:33,987 INFO L168 Benchmark]: TraceAbstraction took 52440.93 ms. Allocated memory was 305.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 232.9 MB in the beginning and 1.2 GB in the end (delta: -991.1 MB). Peak memory consumption was 461.7 MB. Max. memory is 5.3 GB. [2018-01-24 23:20:33,989 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 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.16 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.6 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.25 ms. Allocated memory is still 305.7 MB. Free memory was 254.6 MB in the beginning and 252.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 334.35 ms. Allocated memory is still 305.7 MB. Free memory was 252.5 MB in the beginning and 232.9 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52440.93 ms. Allocated memory was 305.7 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 232.9 MB in the beginning and 1.2 GB in the end (delta: -991.1 MB). Peak memory consumption was 461.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 554). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 554). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 555). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 548). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 548). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 548). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 548). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 572). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 571). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 572). Cancelled while BasicCegarLoop was analyzing trace of length 28 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 571). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 28 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, 55 locations, 13 error locations. TIMEOUT Result, 52.3s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 676 SDtfs, 933 SDslu, 1660 SDs, 0 SdLazy, 1020 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 47.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 65 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 29767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 10/10 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_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-20-33-998.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-20-33-998.csv Completed graceful shutdown