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_cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:21:13,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:21:13,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:21:13,996 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:21:13,996 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:21:13,997 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:21:13,998 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:21:14,000 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:21:14,002 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:21:14,003 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:21:14,003 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:21:14,004 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:21:14,005 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:21:14,006 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:21:14,007 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:21:14,009 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:21:14,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:21:14,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:21:14,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:21:14,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:21:14,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:21:14,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:21:14,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:21:14,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:21:14,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:21:14,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:21:14,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:21:14,023 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:21:14,024 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:21:14,024 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:21:14,024 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:21:14,025 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:21:14,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:21:14,034 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:21:14,035 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:21:14,035 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:21:14,035 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:21:14,035 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:21:14,035 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:21:14,035 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:21:14,036 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:21:14,036 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:21:14,036 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:21:14,036 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:21:14,037 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:21:14,037 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:21:14,037 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:21:14,037 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:21:14,037 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:21:14,037 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:21:14,037 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:21:14,038 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:21:14,038 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:21:14,038 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:21:14,038 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:21:14,038 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:21:14,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:21:14,039 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:21:14,039 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:21:14,039 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:21:14,039 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:21:14,039 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:21:14,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:21:14,040 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:21:14,040 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:21:14,040 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:21:14,040 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:21:14,041 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:21:14,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:21:14,083 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:21:14,087 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:21:14,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:21:14,088 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:21:14,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:21:14,237 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:21:14,242 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:21:14,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:21:14,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:21:14,248 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:21:14,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:21:14" (1/1) ... [2018-01-24 23:21:14,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14, skipping insertion in model container [2018-01-24 23:21:14,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:21:14" (1/1) ... [2018-01-24 23:21:14,265 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:21:14,302 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:21:14,410 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:21:14,424 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:21:14,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14 WrapperNode [2018-01-24 23:21:14,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:21:14,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:21:14,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:21:14,432 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:21:14,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14" (1/1) ... [2018-01-24 23:21:14,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14" (1/1) ... [2018-01-24 23:21:14,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14" (1/1) ... [2018-01-24 23:21:14,459 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14" (1/1) ... [2018-01-24 23:21:14,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14" (1/1) ... [2018-01-24 23:21:14,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14" (1/1) ... [2018-01-24 23:21:14,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14" (1/1) ... [2018-01-24 23:21:14,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:21:14,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:21:14,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:21:14,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:21:14,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14" (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:21:14,513 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:21:14,513 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:21:14,513 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-24 23:21:14,513 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:21:14,514 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:21:14,514 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:21:14,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:21:14,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:21:14,514 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:21:14,514 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:21:14,514 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-24 23:21:14,514 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:21:14,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:21:14,514 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:21:14,718 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:21:14,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:21:14 BoogieIcfgContainer [2018-01-24 23:21:14,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:21:14,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:21:14,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:21:14,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:21:14,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:21:14" (1/3) ... [2018-01-24 23:21:14,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65797067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:21:14, skipping insertion in model container [2018-01-24 23:21:14,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:21:14" (2/3) ... [2018-01-24 23:21:14,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65797067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:21:14, skipping insertion in model container [2018-01-24 23:21:14,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:21:14" (3/3) ... [2018-01-24 23:21:14,723 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:21:14,730 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:21:14,736 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 23:21:14,775 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:21:14,775 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:21:14,775 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:21:14,775 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:21:14,775 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:21:14,775 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:21:14,776 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:21:14,776 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:21:14,777 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:21:14,800 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-01-24 23:21:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:21:14,807 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:14,809 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:14,809 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:14,813 INFO L82 PathProgramCache]: Analyzing trace with hash -428881312, now seen corresponding path program 1 times [2018-01-24 23:21:14,815 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:14,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:14,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:14,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:14,857 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:14,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:15,007 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:21:15,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:15,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:21:15,010 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:15,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:21:15,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:21:15,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:21:15,031 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-01-24 23:21:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:15,236 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-24 23:21:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:21:15,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 23:21:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:15,251 INFO L225 Difference]: With dead ends: 61 [2018-01-24 23:21:15,251 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 23:21:15,255 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:21:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 23:21:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 23:21:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 23:21:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-24 23:21:15,295 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-01-24 23:21:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:15,295 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-24 23:21:15,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:21:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-24 23:21:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:21:15,296 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:15,296 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:15,296 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:15,296 INFO L82 PathProgramCache]: Analyzing trace with hash -428881311, now seen corresponding path program 1 times [2018-01-24 23:21:15,296 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:15,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:15,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:15,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:15,298 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:15,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:15,444 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:21:15,444 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:15,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:21:15,444 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:15,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:21:15,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:21:15,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:21:15,447 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-01-24 23:21:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:15,510 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-01-24 23:21:15,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:21:15,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 23:21:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:15,512 INFO L225 Difference]: With dead ends: 44 [2018-01-24 23:21:15,512 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 23:21:15,513 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:21:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 23:21:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 23:21:15,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 23:21:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 23:21:15,518 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 13 [2018-01-24 23:21:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:15,518 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 23:21:15,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:21:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 23:21:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:21:15,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:15,519 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:15,519 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:15,520 INFO L82 PathProgramCache]: Analyzing trace with hash 551620863, now seen corresponding path program 1 times [2018-01-24 23:21:15,533 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:15,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:15,534 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:15,534 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:15,535 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:15,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:15,690 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:21:15,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:15,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:21:15,691 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:15,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:21:15,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:21:15,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:21:15,692 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-01-24 23:21:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:15,830 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-01-24 23:21:15,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:21:15,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-24 23:21:15,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:15,834 INFO L225 Difference]: With dead ends: 46 [2018-01-24 23:21:15,834 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 23:21:15,834 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:21:15,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 23:21:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-24 23:21:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 23:21:15,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-24 23:21:15,840 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 18 [2018-01-24 23:21:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:15,841 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-24 23:21:15,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:21:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-24 23:21:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:21:15,841 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:15,842 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:15,842 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash 551620864, now seen corresponding path program 1 times [2018-01-24 23:21:15,842 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:15,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:15,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:15,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:15,843 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:15,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:16,021 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:21:16,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:16,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 23:21:16,021 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:16,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 23:21:16,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 23:21:16,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:21:16,022 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2018-01-24 23:21:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:16,223 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-01-24 23:21:16,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:21:16,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-01-24 23:21:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:16,225 INFO L225 Difference]: With dead ends: 49 [2018-01-24 23:21:16,226 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 23:21:16,226 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-01-24 23:21:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 23:21:16,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-01-24 23:21:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 23:21:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-24 23:21:16,234 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 18 [2018-01-24 23:21:16,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:16,234 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-24 23:21:16,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 23:21:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-24 23:21:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:21:16,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:16,235 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:16,235 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash -79622450, now seen corresponding path program 1 times [2018-01-24 23:21:16,236 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:16,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:16,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:16,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:16,237 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:16,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:16,356 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:21:16,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:16,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 23:21:16,357 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:16,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 23:21:16,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 23:21:16,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:21:16,357 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-01-24 23:21:16,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:16,530 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-24 23:21:16,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:21:16,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-01-24 23:21:16,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:16,531 INFO L225 Difference]: With dead ends: 47 [2018-01-24 23:21:16,531 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 23:21:16,532 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 23:21:16,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 23:21:16,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-24 23:21:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 23:21:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 23:21:16,537 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-01-24 23:21:16,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:16,537 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 23:21:16,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 23:21:16,538 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 23:21:16,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 23:21:16,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:16,538 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:16,538 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:16,539 INFO L82 PathProgramCache]: Analyzing trace with hash -79622449, now seen corresponding path program 1 times [2018-01-24 23:21:16,539 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:16,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:16,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:16,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:16,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:16,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:16,682 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:21:16,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:16,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 23:21:16,683 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:16,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 23:21:16,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 23:21:16,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:21:16,684 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-01-24 23:21:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:16,845 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-01-24 23:21:16,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:21:16,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-01-24 23:21:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:16,847 INFO L225 Difference]: With dead ends: 46 [2018-01-24 23:21:16,847 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 23:21:16,847 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 23:21:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 23:21:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-01-24 23:21:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 23:21:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-24 23:21:16,858 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 19 [2018-01-24 23:21:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:16,858 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-24 23:21:16,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 23:21:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-24 23:21:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:21:16,859 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:16,860 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:16,860 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 670305991, now seen corresponding path program 1 times [2018-01-24 23:21:16,860 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:16,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:16,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:16,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:16,861 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:16,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:16,912 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:21:16,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:16,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:21:16,914 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:16,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:21:16,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:21:16,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:21:16,915 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-01-24 23:21:16,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:16,981 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-24 23:21:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:21:16,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 23:21:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:16,983 INFO L225 Difference]: With dead ends: 47 [2018-01-24 23:21:16,983 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 23:21:16,983 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:21:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 23:21:16,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-24 23:21:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 23:21:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 23:21:16,989 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-01-24 23:21:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:16,989 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 23:21:16,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:21:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 23:21:16,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:21:16,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:16,990 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:16,990 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:16,990 INFO L82 PathProgramCache]: Analyzing trace with hash 670305992, now seen corresponding path program 1 times [2018-01-24 23:21:16,990 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:16,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:16,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:16,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:16,991 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:17,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:17,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:17,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:21:17,177 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:17,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:21:17,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:21:17,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:21:17,178 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-01-24 23:21:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:17,432 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-01-24 23:21:17,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:21:17,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-24 23:21:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:17,434 INFO L225 Difference]: With dead ends: 112 [2018-01-24 23:21:17,434 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 23:21:17,435 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:21:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 23:21:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2018-01-24 23:21:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 23:21:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-01-24 23:21:17,447 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 24 [2018-01-24 23:21:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:17,448 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-01-24 23:21:17,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:21:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-01-24 23:21:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:21:17,449 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:17,449 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:17,449 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash 689332191, now seen corresponding path program 1 times [2018-01-24 23:21:17,450 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:17,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:17,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:17,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:17,451 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:17,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:17,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:17,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:21:17,589 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:17,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:21:17,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:21:17,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:21:17,589 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 7 states. [2018-01-24 23:21:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:17,656 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-01-24 23:21:17,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:21:17,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-24 23:21:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:17,658 INFO L225 Difference]: With dead ends: 94 [2018-01-24 23:21:17,658 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 23:21:17,658 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:21:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 23:21:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-01-24 23:21:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 23:21:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-24 23:21:17,669 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 24 [2018-01-24 23:21:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:17,669 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-24 23:21:17,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:21:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-24 23:21:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:21:17,671 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:17,671 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:17,671 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash -918041910, now seen corresponding path program 1 times [2018-01-24 23:21:17,672 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:17,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:17,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:17,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:17,673 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:17,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:18,001 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:21:18,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:18,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 23:21:18,002 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:18,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 23:21:18,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 23:21:18,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-24 23:21:18,003 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 13 states. [2018-01-24 23:21:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:18,250 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-01-24 23:21:18,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 23:21:18,251 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-01-24 23:21:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:18,251 INFO L225 Difference]: With dead ends: 74 [2018-01-24 23:21:18,251 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 23:21:18,252 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-01-24 23:21:18,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 23:21:18,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-01-24 23:21:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 23:21:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-01-24 23:21:18,260 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2018-01-24 23:21:18,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:18,260 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-01-24 23:21:18,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 23:21:18,260 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-01-24 23:21:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:21:18,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:18,262 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:18,262 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash -899015711, now seen corresponding path program 1 times [2018-01-24 23:21:18,262 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:18,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:18,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:18,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:18,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:18,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:18,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:18,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 23:21:18,470 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:18,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 23:21:18,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 23:21:18,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-24 23:21:18,471 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 11 states. [2018-01-24 23:21:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:18,687 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-01-24 23:21:18,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 23:21:18,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-01-24 23:21:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:18,690 INFO L225 Difference]: With dead ends: 148 [2018-01-24 23:21:18,690 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 23:21:18,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-01-24 23:21:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 23:21:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-01-24 23:21:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 23:21:18,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-01-24 23:21:18,707 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 24 [2018-01-24 23:21:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:18,708 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-01-24 23:21:18,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 23:21:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-01-24 23:21:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 23:21:18,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:18,710 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:21:18,710 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:18,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1401806879, now seen corresponding path program 1 times [2018-01-24 23:21:18,710 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:18,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:18,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:18,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:18,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:18,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:18,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:21:18,969 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:21:18,970 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 23:21:18,971 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [10], [11], [36], [38], [43], [52], [53], [57], [62], [68], [70], [71], [72], [73], [74], [85], [86], [87], [89] [2018-01-24 23:21:19,017 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:21:19,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 23:21:41,960 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 23:21:41,962 INFO L268 AbstractInterpreter]: Visited 23 different actions 41 times. Merged at 7 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 23:21:41,982 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 23:21:41,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:21:41,983 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:21:41,992 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:41,993 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:21:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:42,046 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:21:42,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 23:21:42,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 23:21:42,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:42,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:42,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 23:21:42,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 23:21:42,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 23:21:42,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:21:42,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:21:42,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:21:42,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:21:42,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 23:21:42,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:42,475 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:21:42,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 23:21:42,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:42,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-01-24 23:21:42,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-01-24 23:21:42,853 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:42,854 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:42,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:42,859 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-24 23:21:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:42,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:21:42,900 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 23:21:42,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:42,904 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:21:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:42,996 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:21:43,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 23:21:43,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:43,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:43,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 23:21:43,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 23:21:43,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 23:21:43,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:43,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:43,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:43,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 23:21:43,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 23:21:43,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 23:21:43,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 23:21:43,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:21:43,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 23:21:43,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 23:21:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:43,370 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 23:21:43,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 23:21:43,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 23:21:43,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 23:21:43,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:43,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 23:21:43,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 23:21:43,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:43,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 23:21:43,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 42 [2018-01-24 23:21:43,620 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 23:21:43,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 23:21:43,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 23:21:43,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1647, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 23:21:43,621 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 19 states. [2018-01-24 23:21:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:46,495 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2018-01-24 23:21:46,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 23:21:46,495 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-01-24 23:21:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:46,496 INFO L225 Difference]: With dead ends: 138 [2018-01-24 23:21:46,496 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 23:21:46,497 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=269, Invalid=2487, Unknown=0, NotChecked=0, Total=2756 [2018-01-24 23:21:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 23:21:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-01-24 23:21:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 23:21:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-01-24 23:21:46,512 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 24 [2018-01-24 23:21:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:46,512 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-01-24 23:21:46,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 23:21:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-01-24 23:21:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 23:21:46,514 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:46,514 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] [2018-01-24 23:21:46,514 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1797191857, now seen corresponding path program 1 times [2018-01-24 23:21:46,515 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:46,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:46,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:46,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:46,516 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:46,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:46,621 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:21:46,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:21:46,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:21:46,621 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:21:46,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:21:46,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:21:46,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:21:46,622 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 6 states. [2018-01-24 23:21:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:21:46,792 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-01-24 23:21:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:21:46,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 23:21:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:21:46,793 INFO L225 Difference]: With dead ends: 115 [2018-01-24 23:21:46,793 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 23:21:46,794 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:21:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 23:21:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-01-24 23:21:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 23:21:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 23:21:46,802 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 25 [2018-01-24 23:21:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:21:46,803 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 23:21:46,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:21:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 23:21:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 23:21:46,804 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:21:46,804 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] [2018-01-24 23:21:46,804 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 23:21:46,804 INFO L82 PathProgramCache]: Analyzing trace with hash 506340240, now seen corresponding path program 1 times [2018-01-24 23:21:46,805 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:21:46,805 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:46,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:21:46,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:21:46,806 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:21:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:21:46,823 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:21:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:21:47,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:21:47,089 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:21:47,089 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 23:21:47,089 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [11], [13], [36], [38], [43], [52], [53], [57], [62], [68], [70], [71], [72], [73], [74], [85], [86], [87], [89] [2018-01-24 23:21:47,090 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:21:47,090 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 23:22:08,978 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 23:22:08,979 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 23:22:08,979 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:22:08,979 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:22:08,979 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:22:08,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:22:08,984 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:22:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:22:09,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:22:09,005 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 23:22:09,005 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:22:09,009 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:22:09,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:22:09 BoogieIcfgContainer [2018-01-24 23:22:09,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:22:09,010 INFO L168 Benchmark]: Toolchain (without parser) took 54772.61 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 266.2 MB in the beginning and 460.9 MB in the end (delta: -194.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 23:22:09,011 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:22:09,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.49 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 255.0 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:22:09,012 INFO L168 Benchmark]: Boogie Preprocessor took 35.76 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 253.1 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:22:09,012 INFO L168 Benchmark]: RCFGBuilder took 250.51 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 235.2 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 5.3 GB. [2018-01-24 23:22:09,012 INFO L168 Benchmark]: TraceAbstraction took 54290.83 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 235.2 MB in the beginning and 460.9 MB in the end (delta: -225.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-24 23:22:09,014 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.11 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 188.49 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 255.0 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.76 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 253.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 250.51 ms. Allocated memory is still 306.2 MB. Free memory was 253.1 MB in the beginning and 235.2 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54290.83 ms. Allocated memory was 306.2 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 235.2 MB in the beginning and 460.9 MB in the end (delta: -225.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 284 LocStat_NO_SUPPORTING_DISEQUALITIES : 43 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 65 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 12.454350 RENAME_VARIABLES(MILLISECONDS) : 0.604912 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 12.397393 PROJECTAWAY(MILLISECONDS) : 520.865304 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.068157 DISJOIN(MILLISECONDS) : 1.067554 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.627751 ADD_EQUALITY(MILLISECONDS) : 0.011917 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.019971 #CONJOIN_DISJUNCTIVE : 71 #RENAME_VARIABLES : 121 #UNFREEZE : 0 #CONJOIN : 125 #PROJECTAWAY : 93 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 115 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 549). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 547). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 547). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 547). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 567). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 26 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 567). Cancelled while BasicCegarLoop was analyzing trace of length 26 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, 48 locations, 9 error locations. TIMEOUT Result, 54.2s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 494 SDtfs, 661 SDslu, 1978 SDs, 0 SdLazy, 1240 SolverSat, 112 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 44.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 89 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 348 ConstructedInterpolants, 9 QuantifiedInterpolants, 50951 SizeOfPredicates, 28 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 4/14 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_cstrncpy-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-22-09-024.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_23-22-09-024.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_23-22-09-024.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-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-22-09-024.csv Completed graceful shutdown