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.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 15:21:10,741 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:21:10,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:21:10,757 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:21:10,758 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:21:10,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:21:10,760 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:21:10,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:21:10,764 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:21:10,764 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:21:10,765 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:21:10,766 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:21:10,767 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:21:10,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:21:10,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:21:10,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:21:10,773 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:21:10,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:21:10,777 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:21:10,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:21:10,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:21:10,781 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:21:10,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:21:10,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:21:10,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:21:10,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:21:10,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:21:10,785 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:21:10,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:21:10,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:21:10,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:21:10,786 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.epf [2018-01-24 15:21:10,794 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:21:10,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:21:10,795 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:21:10,795 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:21:10,795 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:21:10,795 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:21:10,795 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:21:10,796 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:21:10,796 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:21:10,796 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:21:10,796 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:21:10,796 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:21:10,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:21:10,797 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:21:10,797 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:21:10,797 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:21:10,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:21:10,797 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:21:10,797 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:21:10,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:21:10,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:21:10,798 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:21:10,798 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:21:10,798 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:21:10,798 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:21:10,799 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:21:10,799 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:21:10,799 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:21:10,799 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:21:10,799 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:21:10,799 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:21:10,799 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:21:10,799 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:21:10,800 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:21:10,800 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:21:10,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:21:10,843 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:21:10,846 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:21:10,847 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:21:10,847 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:21:10,848 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 15:21:11,025 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:21:11,030 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:21:11,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:21:11,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:21:11,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:21:11,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:21:11" (1/1) ... [2018-01-24 15:21:11,072 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 03:21:11, skipping insertion in model container [2018-01-24 15:21:11,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:21:11" (1/1) ... [2018-01-24 15:21:11,085 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:21:11,121 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:21:11,239 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:21:11,256 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:21:11,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:21:11 WrapperNode [2018-01-24 15:21:11,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:21:11,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:21:11,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:21:11,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:21:11,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:21:11" (1/1) ... [2018-01-24 15:21:11,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:21:11" (1/1) ... [2018-01-24 15:21:11,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:21:11" (1/1) ... [2018-01-24 15:21:11,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:21:11" (1/1) ... [2018-01-24 15:21:11,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:21:11" (1/1) ... [2018-01-24 15:21:11,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:21:11" (1/1) ... [2018-01-24 15:21:11,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:21:11" (1/1) ... [2018-01-24 15:21:11,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:21:11,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:21:11,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:21:11,294 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:21:11,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:21:11" (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 15:21:11,345 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:21:11,345 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:21:11,345 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-24 15:21:11,345 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:21:11,345 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:21:11,346 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:21:11,346 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:21:11,346 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:21:11,346 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:21:11,346 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:21:11,346 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-24 15:21:11,347 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:21:11,347 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:21:11,347 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:21:11,546 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:21:11,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:21:11 BoogieIcfgContainer [2018-01-24 15:21:11,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:21:11,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:21:11,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:21:11,549 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:21:11,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:21:11" (1/3) ... [2018-01-24 15:21:11,551 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 03:21:11, skipping insertion in model container [2018-01-24 15:21:11,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:21:11" (2/3) ... [2018-01-24 15:21:11,551 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 03:21:11, skipping insertion in model container [2018-01-24 15:21:11,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:21:11" (3/3) ... [2018-01-24 15:21:11,553 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:21:11,560 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:21:11,566 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 15:21:11,610 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:21:11,610 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:21:11,611 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:21:11,611 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:21:11,611 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:21:11,611 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:21:11,611 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:21:11,611 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:21:11,612 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:21:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-01-24 15:21:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:21:11,632 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:11,634 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:21:11,634 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:11,639 INFO L82 PathProgramCache]: Analyzing trace with hash -428881312, now seen corresponding path program 1 times [2018-01-24 15:21:11,642 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:11,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:11,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:11,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:11,684 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:11,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:11,826 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 15:21:11,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:11,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:21:11,830 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:11,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:21:11,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:21:11,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:21:11,850 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-01-24 15:21:12,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:12,067 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-24 15:21:12,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:21:12,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 15:21:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:12,080 INFO L225 Difference]: With dead ends: 61 [2018-01-24 15:21:12,080 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 15:21:12,084 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 15:21:12,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 15:21:12,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 15:21:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 15:21:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-24 15:21:12,125 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-01-24 15:21:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:12,126 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-24 15:21:12,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:21:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-24 15:21:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:21:12,127 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:12,127 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:21:12,127 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash -428881311, now seen corresponding path program 1 times [2018-01-24 15:21:12,127 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:12,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:12,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:12,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:12,129 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:12,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:12,244 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 15:21:12,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:12,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:21:12,245 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:12,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:21:12,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:21:12,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:21:12,247 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-01-24 15:21:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:12,292 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-01-24 15:21:12,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:21:12,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-01-24 15:21:12,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:12,293 INFO L225 Difference]: With dead ends: 44 [2018-01-24 15:21:12,293 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 15:21:12,294 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 15:21:12,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 15:21:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 15:21:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 15:21:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 15:21:12,298 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 13 [2018-01-24 15:21:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:12,299 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 15:21:12,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:21:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 15:21:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:21:12,299 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:12,300 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 15:21:12,300 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash 551620863, now seen corresponding path program 1 times [2018-01-24 15:21:12,300 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:12,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:12,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:12,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:12,302 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:12,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:12,402 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 15:21:12,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:12,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:21:12,403 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:12,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:21:12,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:21:12,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:21:12,404 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-01-24 15:21:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:12,549 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-01-24 15:21:12,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:21:12,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-24 15:21:12,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:12,552 INFO L225 Difference]: With dead ends: 46 [2018-01-24 15:21:12,552 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 15:21:12,553 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:21:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 15:21:12,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-24 15:21:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 15:21:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-01-24 15:21:12,558 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 18 [2018-01-24 15:21:12,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:12,558 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-01-24 15:21:12,558 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:21:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-01-24 15:21:12,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:21:12,559 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:12,559 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 15:21:12,559 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:12,559 INFO L82 PathProgramCache]: Analyzing trace with hash 551620864, now seen corresponding path program 1 times [2018-01-24 15:21:12,559 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:12,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:12,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:12,561 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:12,561 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:12,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:12,721 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 15:21:12,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:12,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:21:12,721 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:12,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:21:12,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:21:12,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:21:12,722 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2018-01-24 15:21:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:12,864 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-01-24 15:21:12,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:21:12,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-01-24 15:21:12,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:12,866 INFO L225 Difference]: With dead ends: 49 [2018-01-24 15:21:12,866 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 15:21:12,866 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 15:21:12,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 15:21:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-01-24 15:21:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 15:21:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-24 15:21:12,873 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 18 [2018-01-24 15:21:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:12,874 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-24 15:21:12,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:21:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-24 15:21:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:21:12,875 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:12,875 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 15:21:12,875 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash -79622450, now seen corresponding path program 1 times [2018-01-24 15:21:12,876 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:12,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:12,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:12,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:12,877 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:12,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:12,993 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 15:21:12,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:12,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:21:12,994 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:12,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:21:12,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:21:12,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:21:12,994 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-01-24 15:21:13,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:13,142 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-24 15:21:13,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:21:13,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-01-24 15:21:13,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:13,143 INFO L225 Difference]: With dead ends: 47 [2018-01-24 15:21:13,143 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:21:13,144 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 15:21:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:21:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-24 15:21:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 15:21:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 15:21:13,151 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-01-24 15:21:13,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:13,151 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 15:21:13,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:21:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 15:21:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 15:21:13,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:13,153 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 15:21:13,153 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash -79622449, now seen corresponding path program 1 times [2018-01-24 15:21:13,153 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:13,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:13,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:13,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:13,155 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:13,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:13,279 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 15:21:13,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:13,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 15:21:13,279 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:13,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 15:21:13,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 15:21:13,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:21:13,281 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-01-24 15:21:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:13,435 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-01-24 15:21:13,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:21:13,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-01-24 15:21:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:13,436 INFO L225 Difference]: With dead ends: 46 [2018-01-24 15:21:13,436 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 15:21:13,437 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 15:21:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 15:21:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-01-24 15:21:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 15:21:13,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-24 15:21:13,441 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 19 [2018-01-24 15:21:13,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:13,442 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-24 15:21:13,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 15:21:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-24 15:21:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:21:13,442 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:13,442 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 15:21:13,443 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash 670305991, now seen corresponding path program 1 times [2018-01-24 15:21:13,443 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:13,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:13,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:13,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:13,444 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:13,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:13,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:13,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:21:13,500 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:13,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:21:13,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:21:13,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:21:13,502 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-01-24 15:21:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:13,595 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-01-24 15:21:13,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:21:13,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 15:21:13,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:13,597 INFO L225 Difference]: With dead ends: 47 [2018-01-24 15:21:13,597 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 15:21:13,597 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 15:21:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 15:21:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-24 15:21:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 15:21:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-24 15:21:13,601 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-01-24 15:21:13,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:13,602 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-24 15:21:13,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:21:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-24 15:21:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:21:13,602 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:13,602 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 15:21:13,602 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash 670305992, now seen corresponding path program 1 times [2018-01-24 15:21:13,603 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:13,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:13,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:13,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:13,604 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:13,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:13,753 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 15:21:13,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:13,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:21:13,754 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:13,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:21:13,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:21:13,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:21:13,755 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-01-24 15:21:13,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:13,904 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-01-24 15:21:13,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:21:13,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-24 15:21:13,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:13,906 INFO L225 Difference]: With dead ends: 112 [2018-01-24 15:21:13,906 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 15:21:13,906 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:21:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 15:21:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2018-01-24 15:21:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-24 15:21:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-01-24 15:21:13,918 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 24 [2018-01-24 15:21:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:13,918 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-01-24 15:21:13,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:21:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-01-24 15:21:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:21:13,920 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:13,920 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 15:21:13,920 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash 689332191, now seen corresponding path program 1 times [2018-01-24 15:21:13,920 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:13,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:13,921 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:13,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:13,922 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:13,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:14,067 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 15:21:14,067 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:14,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:21:14,068 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:14,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:21:14,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:21:14,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:21:14,068 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 7 states. [2018-01-24 15:21:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:14,145 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2018-01-24 15:21:14,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:21:14,146 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-24 15:21:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:14,147 INFO L225 Difference]: With dead ends: 94 [2018-01-24 15:21:14,147 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 15:21:14,147 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 15:21:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 15:21:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-01-24 15:21:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-24 15:21:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-24 15:21:14,156 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 24 [2018-01-24 15:21:14,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:14,156 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-24 15:21:14,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:21:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-24 15:21:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:21:14,158 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:14,158 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 15:21:14,158 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:14,158 INFO L82 PathProgramCache]: Analyzing trace with hash -918041910, now seen corresponding path program 1 times [2018-01-24 15:21:14,159 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:14,159 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:14,159 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:14,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:14,160 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:14,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:14,400 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 15:21:14,400 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:14,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 15:21:14,400 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:14,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 15:21:14,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 15:21:14,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:21:14,401 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 13 states. [2018-01-24 15:21:14,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:14,600 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2018-01-24 15:21:14,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 15:21:14,600 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-01-24 15:21:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:14,601 INFO L225 Difference]: With dead ends: 74 [2018-01-24 15:21:14,601 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 15:21:14,602 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-01-24 15:21:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 15:21:14,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-01-24 15:21:14,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 15:21:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-01-24 15:21:14,610 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2018-01-24 15:21:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:14,610 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-01-24 15:21:14,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 15:21:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-01-24 15:21:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:21:14,611 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:14,611 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 15:21:14,612 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash -899015711, now seen corresponding path program 1 times [2018-01-24 15:21:14,612 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:14,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:14,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:14,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:14,613 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:14,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:14,779 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 15:21:14,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:14,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-24 15:21:14,780 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:14,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 15:21:14,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 15:21:14,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-24 15:21:14,781 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 11 states. [2018-01-24 15:21:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:15,147 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2018-01-24 15:21:15,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 15:21:15,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-01-24 15:21:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:15,150 INFO L225 Difference]: With dead ends: 148 [2018-01-24 15:21:15,150 INFO L226 Difference]: Without dead ends: 119 [2018-01-24 15:21:15,151 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 15:21:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-24 15:21:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-01-24 15:21:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-01-24 15:21:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-01-24 15:21:15,166 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 24 [2018-01-24 15:21:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:15,166 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-01-24 15:21:15,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 15:21:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-01-24 15:21:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 15:21:15,168 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:15,168 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 15:21:15,168 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1401806879, now seen corresponding path program 1 times [2018-01-24 15:21:15,168 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:15,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:15,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:15,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:15,170 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:15,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:15,470 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 15:21:15,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:15,470 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:21:15,471 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 15:21:15,472 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 15:21:15,519 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:21:15,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:21:17,941 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:21:17,943 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 15:21:17,956 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:21:17,957 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:17,957 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 15:21:17,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:17,977 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:21:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:18,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:18,069 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 15:21:18,075 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 15:21:18,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:18,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:18,110 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 15:21:18,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 15:21:18,521 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 15:21:18,542 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 15:21:18,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:21:18,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:18,615 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 15:21:18,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 15:21:18,818 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 15:21:18,818 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:19,599 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 15:21:19,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:19,610 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 15:21:19,625 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 15:21:19,625 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:19,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:19,636 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 15:21:19,636 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:39, output treesize:7 [2018-01-24 15:21:19,646 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 15:21:19,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:19,681 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 15:21:19,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:19,692 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:21:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:19,776 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:19,789 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 15:21:19,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:19,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:19,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 15:21:19,850 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 15:21:19,851 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 15:21:19,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:19,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:19,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:19,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 15:21:20,057 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 15:21:20,072 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 15:21:20,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:21:20,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:20,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:20,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-24 15:21:20,251 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 15:21:20,251 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:20,405 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 15:21:20,413 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 15:21:20,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:20,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:20,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:20,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 15:21:20,505 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 15:21:20,507 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:21:20,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 12, 12] total 42 [2018-01-24 15:21:20,508 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:21:20,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 15:21:20,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 15:21:20,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1647, Unknown=0, NotChecked=0, Total=1806 [2018-01-24 15:21:20,510 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 19 states. [2018-01-24 15:21:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:23,404 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2018-01-24 15:21:23,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-24 15:21:23,404 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-01-24 15:21:23,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:23,405 INFO L225 Difference]: With dead ends: 138 [2018-01-24 15:21:23,406 INFO L226 Difference]: Without dead ends: 137 [2018-01-24 15:21:23,406 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=269, Invalid=2487, Unknown=0, NotChecked=0, Total=2756 [2018-01-24 15:21:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-24 15:21:23,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-01-24 15:21:23,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 15:21:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-01-24 15:21:23,420 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 24 [2018-01-24 15:21:23,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:23,421 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-01-24 15:21:23,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 15:21:23,421 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-01-24 15:21:23,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 15:21:23,422 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:23,422 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 15:21:23,422 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:23,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1797191857, now seen corresponding path program 1 times [2018-01-24 15:21:23,422 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:23,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:23,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:23,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:23,423 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:23,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:23,526 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 15:21:23,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:21:23,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:21:23,527 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:21:23,528 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:21:23,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:21:23,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:21:23,528 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 6 states. [2018-01-24 15:21:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:23,673 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-01-24 15:21:23,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 15:21:23,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 15:21:23,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:23,674 INFO L225 Difference]: With dead ends: 115 [2018-01-24 15:21:23,674 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 15:21:23,675 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 15:21:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 15:21:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-01-24 15:21:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 15:21:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 15:21:23,682 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 25 [2018-01-24 15:21:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:23,682 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 15:21:23,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:21:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 15:21:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 15:21:23,683 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:23,683 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 15:21:23,683 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash 506340240, now seen corresponding path program 1 times [2018-01-24 15:21:23,683 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:23,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:23,684 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:23,684 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:23,684 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:23,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:23,874 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 15:21:23,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:23,874 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:21:23,874 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 15:21:23,874 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 15:21:23,875 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:21:23,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:21:26,882 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:21:26,882 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 15:21:26,887 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:21:26,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:26,887 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 15:21:26,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:26,892 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:21:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:26,915 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:26,918 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 15:21:26,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:26,935 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 15:21:26,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:26,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:26,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:21:26,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:26,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:26,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:21:26,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:26,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:21:26,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:27,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:27,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:21:27,378 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 15:21:27,378 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:27,819 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 15:21:27,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:27,840 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:21:27,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:27,844 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:21:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:27,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:27,894 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 15:21:27,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:27,908 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 15:21:27,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:27,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:27,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-01-24 15:21:27,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:27,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:27,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:21:27,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:27,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:21:27,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:27,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:27,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-01-24 15:21:28,152 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 15:21:28,152 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:28,489 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-24 15:21:28,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:28,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 15 [2018-01-24 15:21:28,503 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 15:21:28,504 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:28,505 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-24 15:21:28,506 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:28,509 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:28,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:28,513 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:28, output treesize:11 [2018-01-24 15:21:28,559 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 15:21:28,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:21:28,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12, 14, 13] total 50 [2018-01-24 15:21:28,561 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:21:28,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 15:21:28,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 15:21:28,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2332, Unknown=0, NotChecked=0, Total=2550 [2018-01-24 15:21:28,562 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 26 states. [2018-01-24 15:21:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:29,254 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-01-24 15:21:29,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 15:21:29,255 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-01-24 15:21:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:29,255 INFO L225 Difference]: With dead ends: 58 [2018-01-24 15:21:29,255 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 15:21:29,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=365, Invalid=3295, Unknown=0, NotChecked=0, Total=3660 [2018-01-24 15:21:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 15:21:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-01-24 15:21:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 15:21:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-24 15:21:29,261 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-01-24 15:21:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:29,261 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-24 15:21:29,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 15:21:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-24 15:21:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:21:29,262 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:29,262 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:21:29,262 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:29,262 INFO L82 PathProgramCache]: Analyzing trace with hash -183633860, now seen corresponding path program 1 times [2018-01-24 15:21:29,262 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:29,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:29,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:29,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:29,263 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:29,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:29,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:29,665 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:21:29,665 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:21:29,665 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [11], [16], [20], [22], [27], [28], [30], [31], [52], [53], [57], [60], [68], [70], [71], [72], [73], [74], [85], [86], [87], [89] [2018-01-24 15:21:29,667 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:21:29,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:21:31,754 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:21:31,754 INFO L268 AbstractInterpreter]: Visited 26 different actions 37 times. Merged at 6 different actions 11 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-01-24 15:21:31,761 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:21:31,761 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:31,761 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:21:31,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:31,766 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:21:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:31,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:31,792 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 15:21:31,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:31,797 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 15:21:31,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:31,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:31,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:21:31,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:31,818 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:31,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:21:31,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:31,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:21:31,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:31,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:31,829 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:21:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:32,014 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:32,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:32,489 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:21:32,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:32,492 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:21:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:32,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:32,550 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 15:21:32,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:32,564 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 15:21:32,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:32,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:32,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:21:32,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:32,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:21:32,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:32,585 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:32,586 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:32,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:21:32,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:32,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:32,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:21:32,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:32,922 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:33,577 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:33,577 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:46, output treesize:1 [2018-01-24 15:21:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:33,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:21:33,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14, 15, 14] total 53 [2018-01-24 15:21:33,587 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:21:33,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 15:21:33,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 15:21:33,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2614, Unknown=0, NotChecked=0, Total=2862 [2018-01-24 15:21:33,588 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 23 states. [2018-01-24 15:21:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:34,611 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-01-24 15:21:34,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 15:21:34,612 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-01-24 15:21:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:34,612 INFO L225 Difference]: With dead ends: 68 [2018-01-24 15:21:34,612 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 15:21:34,614 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=539, Invalid=4717, Unknown=0, NotChecked=0, Total=5256 [2018-01-24 15:21:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 15:21:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 15:21:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 15:21:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-01-24 15:21:34,617 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 29 [2018-01-24 15:21:34,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:34,617 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-01-24 15:21:34,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 15:21:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-01-24 15:21:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 15:21:34,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:34,618 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:21:34,618 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:34,618 INFO L82 PathProgramCache]: Analyzing trace with hash 996854439, now seen corresponding path program 1 times [2018-01-24 15:21:34,618 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:34,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:34,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:34,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:34,619 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:34,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:34,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:34,887 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:21:34,887 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 15:21:34,887 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [11], [16], [20], [22], [27], [30], [36], [38], [43], [52], [53], [57], [62], [68], [70], [71], [72], [73], [74], [85], [86], [87], [89] [2018-01-24 15:21:34,888 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:21:34,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:21:38,039 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:21:38,040 INFO L268 AbstractInterpreter]: Visited 27 different actions 56 times. Merged at 11 different actions 28 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 33 variables. [2018-01-24 15:21:38,042 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:21:38,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:38,042 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:21:38,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:38,051 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:21:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:38,077 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:38,082 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 15:21:38,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,089 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 15:21:38,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:21:38,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:38,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:38,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:21:38,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:21:38,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:21:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:38,295 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:38,718 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:38,718 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 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 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:21:38,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:38,722 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:21:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:38,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:38,779 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 15:21:38,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,784 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 15:21:38,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:21:38,793 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:38,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:21:38,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:38,802 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:38,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:21:38,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:38,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:21:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:39,161 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:39,807 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:39,807 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:46, output treesize:1 [2018-01-24 15:21:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:39,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:21:39,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14, 16, 15] total 54 [2018-01-24 15:21:39,815 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:21:39,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 15:21:39,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 15:21:39,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=2712, Unknown=0, NotChecked=0, Total=2970 [2018-01-24 15:21:39,817 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 23 states. [2018-01-24 15:21:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:40,874 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-01-24 15:21:40,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 15:21:40,875 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-01-24 15:21:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:40,875 INFO L225 Difference]: With dead ends: 44 [2018-01-24 15:21:40,875 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 15:21:40,876 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 70 SyntacticMatches, 9 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=523, Invalid=4733, Unknown=0, NotChecked=0, Total=5256 [2018-01-24 15:21:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 15:21:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-01-24 15:21:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-24 15:21:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-01-24 15:21:40,879 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-01-24 15:21:40,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:40,879 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-01-24 15:21:40,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 15:21:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-01-24 15:21:40,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 15:21:40,880 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:40,880 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:21:40,880 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:40,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1015880638, now seen corresponding path program 2 times [2018-01-24 15:21:40,880 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:40,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:40,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:21:40,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:40,881 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:40,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:41,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:41,270 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:21:41,270 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:21:41,271 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:21:41,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:41,271 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:21:41,276 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:21:41,276 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:21:41,287 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:21:41,294 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:21:41,296 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:21:41,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:41,302 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 15:21:41,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:41,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:41,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 15:21:41,308 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 15:21:41,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:41,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:41,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:41,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:21:41,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:41,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:41,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 15:21:41,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 15:21:41,359 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 15:21:41,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:41,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:41,365 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 15:21:41,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 15:21:41,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-24 15:21:41,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 15:21:41,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:41,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:41,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 15:21:41,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-24 15:21:41,650 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 22 treesize of output 18 [2018-01-24 15:21:41,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-24 15:21:41,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:21:41,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:41,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:41,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-24 15:21:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:41,757 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:42,328 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-24 15:21:42,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 15:21:42,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,380 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 22 treesize of output 20 [2018-01-24 15:21:42,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 15:21:42,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,387 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 21 treesize of output 17 [2018-01-24 15:21:42,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-24 15:21:42,389 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,391 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:21:42,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 15:21:42,421 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:110 [2018-01-24 15:21:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:42,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:42,620 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 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 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:21:42,623 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:21:42,623 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:21:42,642 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:21:42,675 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:21:42,725 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:21:42,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:42,733 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 15:21:42,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 15:21:42,739 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 15:21:42,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,744 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:42,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:42,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:21:42,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-24 15:21:42,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-24 15:21:42,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 15:21:42,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:42,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-24 15:21:43,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-24 15:21:43,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 15:21:43,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:43,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:43,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:43,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-01-24 15:21:43,111 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 21 treesize of output 17 [2018-01-24 15:21:43,116 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 17 treesize of output 14 [2018-01-24 15:21:43,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 15:21:43,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:43,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 15:21:43,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 15:21:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:43,155 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:52,445 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-01-24 15:21:52,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-24 15:21:52,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:52,472 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 22 treesize of output 20 [2018-01-24 15:21:52,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-24 15:21:52,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:52,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:52,479 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 21 treesize of output 17 [2018-01-24 15:21:52,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-01-24 15:21:52,481 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:52,482 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:52,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:21:52,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 15:21:52,511 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-01-24 15:21:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:52,729 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:21:52,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16, 16, 16] total 58 [2018-01-24 15:21:52,730 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:21:52,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 15:21:52,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 15:21:52,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=3203, Unknown=4, NotChecked=0, Total=3422 [2018-01-24 15:21:52,731 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 28 states. [2018-01-24 15:21:53,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:53,816 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-01-24 15:21:53,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 15:21:53,816 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2018-01-24 15:21:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:53,817 INFO L225 Difference]: With dead ends: 34 [2018-01-24 15:21:53,817 INFO L226 Difference]: Without dead ends: 33 [2018-01-24 15:21:53,818 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 70 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 8 DeprecatedPredicates, 1242 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=488, Invalid=4910, Unknown=4, NotChecked=0, Total=5402 [2018-01-24 15:21:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-24 15:21:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-01-24 15:21:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 15:21:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-01-24 15:21:53,822 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-01-24 15:21:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:53,822 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-01-24 15:21:53,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 15:21:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-01-24 15:21:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 15:21:53,822 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:21:53,823 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:21:53,823 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-24 15:21:53,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1427528657, now seen corresponding path program 2 times [2018-01-24 15:21:53,823 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:21:53,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:53,824 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 15:21:53,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:21:53,824 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:21:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:21:53,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:21:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:54,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:54,072 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:21:54,072 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 15:21:54,072 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 15:21:54,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:54,073 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:21:54,081 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:21:54,082 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:21:54,094 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:21:54,102 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:21:54,112 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:21:54,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:54,118 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 15:21:54,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:54,124 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 15:21:54,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:54,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:54,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:21:54,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:54,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:54,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:21:54,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:54,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:21:54,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:54,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:54,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:21:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:54,396 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:54,931 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:21:54,931 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 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 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 15:21:54,935 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 15:21:54,935 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 15:21:54,953 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:21:54,994 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 15:21:55,035 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 15:21:55,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:21:55,044 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 15:21:55,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:55,049 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 15:21:55,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:55,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:55,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 15:21:55,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:55,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 15:21:55,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:55,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:55,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:21:55,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 15:21:55,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:55,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:21:55,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 15:21:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:55,539 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:21:56,199 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 15:21:56,199 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:46, output treesize:1 [2018-01-24 15:21:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:21:56,205 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 15:21:56,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15, 17, 16] total 58 [2018-01-24 15:21:56,206 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 15:21:56,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 15:21:56,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 15:21:56,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3138, Unknown=0, NotChecked=0, Total=3422 [2018-01-24 15:21:56,207 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2018-01-24 15:21:57,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:21:57,194 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-01-24 15:21:57,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 15:21:57,194 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-01-24 15:21:57,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:21:57,194 INFO L225 Difference]: With dead ends: 39 [2018-01-24 15:21:57,194 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 15:21:57,196 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=544, Invalid=5156, Unknown=0, NotChecked=0, Total=5700 [2018-01-24 15:21:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 15:21:57,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 15:21:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 15:21:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 15:21:57,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-24 15:21:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:21:57,196 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 15:21:57,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 15:21:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 15:21:57,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 15:21:57,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. Received shutdown request... [2018-01-24 15:21:57,833 INFO L256 ToolchainWalker]: Toolchain cancelled while executing plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction. Reason: Timeout or Toolchain cancelled by user [2018-01-24 15:21:57,834 INFO L168 Benchmark]: Toolchain (without parser) took 46808.38 ms. Allocated memory was 303.0 MB in the beginning and 1.0 GB in the end (delta: 726.7 MB). Free memory was 263.1 MB in the beginning and 725.5 MB in the end (delta: -462.4 MB). Peak memory consumption was 264.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:21:57,835 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:21:57,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.83 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:21:57,835 INFO L168 Benchmark]: Boogie Preprocessor took 32.11 ms. Allocated memory is still 303.0 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:21:57,836 INFO L168 Benchmark]: RCFGBuilder took 252.69 ms. Allocated memory is still 303.0 MB. Free memory was 250.0 MB in the beginning and 232.1 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 5.3 GB. [2018-01-24 15:21:57,836 INFO L168 Benchmark]: TraceAbstraction took 46285.97 ms. Allocated memory was 303.0 MB in the beginning and 1.0 GB in the end (delta: 726.7 MB). Free memory was 232.1 MB in the beginning and 725.5 MB in the end (delta: -493.4 MB). Peak memory consumption was 233.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:21:57,838 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.12 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.83 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.11 ms. Allocated memory is still 303.0 MB. Free memory was 252.0 MB in the beginning and 250.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 252.69 ms. Allocated memory is still 303.0 MB. Free memory was 250.0 MB in the beginning and 232.1 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46285.97 ms. Allocated memory was 303.0 MB in the beginning and 1.0 GB in the end (delta: 726.7 MB). Free memory was 232.1 MB in the beginning and 725.5 MB in the end (delta: -493.4 MB). Peak memory consumption was 233.2 MB. 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 : 277 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) : 15.752716 RENAME_VARIABLES(MILLISECONDS) : 0.999718 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 15.693978 PROJECTAWAY(MILLISECONDS) : 26.910692 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.055760 DISJOIN(MILLISECONDS) : 0.781798 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.032899 ADD_EQUALITY(MILLISECONDS) : 0.016994 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.018422 #CONJOIN_DISJUNCTIVE : 71 #RENAME_VARIABLES : 121 #UNFREEZE : 0 #CONJOIN : 125 #PROJECTAWAY : 93 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 115 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - 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) : 8.468145 RENAME_VARIABLES(MILLISECONDS) : 0.791869 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.076841 PROJECTAWAY(MILLISECONDS) : 0.072408 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.073537 DISJOIN(MILLISECONDS) : 0.826771 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.820072 ADD_EQUALITY(MILLISECONDS) : 0.019601 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015390 #CONJOIN_DISJUNCTIVE : 75 #RENAME_VARIABLES : 130 #UNFREEZE : 0 #CONJOIN : 130 #PROJECTAWAY : 98 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 353 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 72 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 10.424828 RENAME_VARIABLES(MILLISECONDS) : 3.311169 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 5.072992 PROJECTAWAY(MILLISECONDS) : 0.047801 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.043439 DISJOIN(MILLISECONDS) : 0.979778 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 3.347731 ADD_EQUALITY(MILLISECONDS) : 0.016558 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006716 #CONJOIN_DISJUNCTIVE : 63 #RENAME_VARIABLES : 96 #UNFREEZE : 0 #CONJOIN : 120 #PROJECTAWAY : 82 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 4 #RENAME_VARIABLES_DISJUNCTIVE : 93 #ADD_EQUALITY : 75 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 26 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 344 LocStat_NO_SUPPORTING_DISEQUALITIES : 55 LocStat_NO_DISJUNCTIONS : -52 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 72 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.305178 RENAME_VARIABLES(MILLISECONDS) : 0.414087 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.276342 PROJECTAWAY(MILLISECONDS) : 0.738885 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.031298 DISJOIN(MILLISECONDS) : 0.641765 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.430276 ADD_EQUALITY(MILLISECONDS) : 0.011135 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006973 #CONJOIN_DISJUNCTIVE : 99 #RENAME_VARIABLES : 172 #UNFREEZE : 0 #CONJOIN : 155 #PROJECTAWAY : 122 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 167 #ADD_EQUALITY : 74 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Toolchain cancelled while SimplifyDDAWithTimeout was simplifying term of DAG size 196. 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-21-57-850.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-21-57-850.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-21-57-850.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_15-21-57-850.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_15-21-57-850.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_15-21-57-850.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_15-21-57-850.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_15-21-57-850.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_15-21-57-850.csv Completed graceful shutdown