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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:58:36,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:58:36,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:58:36,648 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:58:36,648 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:58:36,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:58:36,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:58:36,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:58:36,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:58:36,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:58:36,653 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:58:36,654 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:58:36,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:58:36,655 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:58:36,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:58:36,657 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:58:36,659 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:58:36,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:58:36,661 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:58:36,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:58:36,663 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:58:36,664 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:58:36,664 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:58:36,665 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:58:36,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:58:36,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:58:36,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:58:36,667 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:58:36,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:58:36,667 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:58:36,667 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:58:36,668 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 14:58:36,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:58:36,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:58:36,677 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:58:36,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:58:36,678 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:58:36,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:58:36,678 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:58:36,678 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:58:36,678 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:58:36,678 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:58:36,678 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:58:36,679 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:58:36,679 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:58:36,679 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:58:36,679 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:58:36,679 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:58:36,679 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:58:36,679 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:58:36,680 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:58:36,680 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:58:36,680 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:58:36,680 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 14:58:36,705 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:58:36,714 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:58:36,717 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:58:36,718 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:58:36,719 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:58:36,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:58:36,840 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:58:36,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:58:36,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:58:36,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:58:36,848 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:58:36,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:36" (1/1) ... [2018-02-04 14:58:36,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4762d03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36, skipping insertion in model container [2018-02-04 14:58:36,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:36" (1/1) ... [2018-02-04 14:58:36,864 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:58:36,892 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:58:36,969 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:58:36,980 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:58:36,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36 WrapperNode [2018-02-04 14:58:36,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:58:36,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:58:36,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:58:36,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:58:36,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36" (1/1) ... [2018-02-04 14:58:36,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36" (1/1) ... [2018-02-04 14:58:36,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36" (1/1) ... [2018-02-04 14:58:36,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36" (1/1) ... [2018-02-04 14:58:37,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36" (1/1) ... [2018-02-04 14:58:37,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36" (1/1) ... [2018-02-04 14:58:37,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36" (1/1) ... [2018-02-04 14:58:37,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:58:37,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:58:37,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:58:37,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:58:37,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 14:58:37,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:58:37,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:58:37,039 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-02-04 14:58:37,039 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:58:37,039 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:58:37,040 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:58:37,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:58:37,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:58:37,040 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:58:37,040 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:58:37,040 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-02-04 14:58:37,040 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:58:37,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:58:37,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:58:37,185 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:58:37,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:37 BoogieIcfgContainer [2018-02-04 14:58:37,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:58:37,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:58:37,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:58:37,187 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:58:37,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:58:36" (1/3) ... [2018-02-04 14:58:37,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4264a8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:37, skipping insertion in model container [2018-02-04 14:58:37,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:36" (2/3) ... [2018-02-04 14:58:37,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4264a8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:37, skipping insertion in model container [2018-02-04 14:58:37,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:37" (3/3) ... [2018-02-04 14:58:37,189 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:58:37,194 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:58:37,199 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-04 14:58:37,231 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:58:37,231 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:58:37,231 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 14:58:37,231 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 14:58:37,231 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:58:37,231 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:58:37,232 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:58:37,232 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:58:37,232 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:58:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-04 14:58:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 14:58:37,252 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:37,252 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:37,253 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:37,257 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-02-04 14:58:37,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:37,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:37,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:58:37,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,379 INFO L182 omatonBuilderFactory]: Interpolants [43#true, 44#false, 45#(<= 1 main_~length1~0), 46#(<= main_~length2~0 main_~length1~0)] [2018-02-04 14:58:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:58:37,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:58:37,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:58:37,389 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-04 14:58:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:37,447 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-04 14:58:37,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:58:37,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 14:58:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:37,454 INFO L225 Difference]: With dead ends: 44 [2018-02-04 14:58:37,454 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 14:58:37,455 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:37,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 14:58:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-04 14:58:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 14:58:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 14:58:37,526 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-02-04 14:58:37,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:37,527 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 14:58:37,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:58:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 14:58:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 14:58:37,527 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:37,528 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:37,528 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:37,528 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-02-04 14:58:37,529 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:37,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,553 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:37,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 14:58:37,554 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,554 INFO L182 omatonBuilderFactory]: Interpolants [131#true, 132#false, 133#(= |#valid| |old(#valid)|)] [2018-02-04 14:58:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 14:58:37,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 14:58:37,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:58:37,556 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-02-04 14:58:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:37,585 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-04 14:58:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 14:58:37,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-04 14:58:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:37,586 INFO L225 Difference]: With dead ends: 39 [2018-02-04 14:58:37,586 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 14:58:37,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 14:58:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 14:58:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-04 14:58:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 14:58:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 14:58:37,589 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-02-04 14:58:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:37,590 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 14:58:37,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 14:58:37,590 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 14:58:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 14:58:37,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:37,590 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:37,590 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:37,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-02-04 14:58:37,591 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:37,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:37,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:58:37,648 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,648 INFO L182 omatonBuilderFactory]: Interpolants [210#true, 211#false, 212#(= 1 (select |#valid| |main_#t~malloc7.base|)), 213#(= 1 (select |#valid| main_~nondetString~0.base))] [2018-02-04 14:58:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:58:37,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:58:37,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:58:37,649 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-02-04 14:58:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:37,723 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 14:58:37,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:58:37,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 14:58:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:37,725 INFO L225 Difference]: With dead ends: 36 [2018-02-04 14:58:37,725 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 14:58:37,725 INFO L554 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-02-04 14:58:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 14:58:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 14:58:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 14:58:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 14:58:37,728 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-02-04 14:58:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:37,729 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 14:58:37,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:58:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 14:58:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 14:58:37,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:37,729 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:37,729 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:37,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-02-04 14:58:37,730 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:37,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:37,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:58:37,809 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,810 INFO L182 omatonBuilderFactory]: Interpolants [288#true, 289#false, 290#(<= 1 main_~length2~0), 291#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 292#(and (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0))] [2018-02-04 14:58:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:58:37,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:58:37,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:37,811 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-04 14:58:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:37,850 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-04 14:58:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:58:37,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 14:58:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:37,851 INFO L225 Difference]: With dead ends: 35 [2018-02-04 14:58:37,851 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 14:58:37,851 INFO L554 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-02-04 14:58:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 14:58:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 14:58:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 14:58:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-04 14:58:37,854 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-02-04 14:58:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:37,854 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-04 14:58:37,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:58:37,854 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-04 14:58:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:58:37,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:37,854 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:37,855 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:37,855 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-02-04 14:58:37,855 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:37,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:37,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:58:37,904 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,905 INFO L182 omatonBuilderFactory]: Interpolants [368#(= 1 (select |#valid| |cstrcpy_#in~s2.base|)), 369#(= 1 (select |#valid| cstrcpy_~src~0.base)), 370#(= 1 (select |#valid| |cstrcpy_#t~post1.base|)), 365#true, 366#false, 367#(= 1 (select |#valid| main_~nondetString~0.base))] [2018-02-04 14:58:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:37,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:58:37,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:58:37,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:37,906 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-02-04 14:58:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:37,984 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-04 14:58:37,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:58:37,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 14:58:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:37,985 INFO L225 Difference]: With dead ends: 34 [2018-02-04 14:58:37,985 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 14:58:37,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:58:37,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 14:58:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-04 14:58:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 14:58:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-04 14:58:37,988 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-02-04 14:58:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:37,989 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-04 14:58:37,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:58:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-04 14:58:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:58:37,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:37,989 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:37,989 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-02-04 14:58:37,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:38,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:38,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:58:38,078 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,078 INFO L182 omatonBuilderFactory]: Interpolants [448#(and (<= 1 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset)), 449#(and (= 0 |cstrcpy_#in~s2.offset|) (<= 1 (select |#length| |cstrcpy_#in~s2.base|))), 450#(and (<= 1 (select |#length| cstrcpy_~src~0.base)) (= 0 cstrcpy_~src~0.offset)), 451#(and (<= 1 (select |#length| |cstrcpy_#t~post1.base|)) (= |cstrcpy_#t~post1.offset| 0)), 443#true, 444#false, 445#(<= 1 main_~length2~0), 446#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 447#(and (<= 1 main_~length2~0) (= 0 main_~nondetString~0.offset) (= main_~length2~0 (select |#length| main_~nondetString~0.base)))] [2018-02-04 14:58:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:58:38,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:58:38,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:58:38,079 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-02-04 14:58:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:38,158 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 14:58:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:58:38,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 14:58:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:38,159 INFO L225 Difference]: With dead ends: 41 [2018-02-04 14:58:38,159 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 14:58:38,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 14:58:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-02-04 14:58:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 14:58:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 14:58:38,163 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-02-04 14:58:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:38,163 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 14:58:38,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:58:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 14:58:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:58:38,164 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:38,164 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:38,164 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:38,164 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-02-04 14:58:38,165 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:38,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:38,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:58:38,233 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,234 INFO L182 omatonBuilderFactory]: Interpolants [544#(= 1 (select |#valid| |cstrcpy_#t~post0.base|)), 536#true, 537#false, 538#(= 1 (select |#valid| |main_#t~malloc6.base|)), 539#(= 1 (select |#valid| main_~nondetArea~0.base)), 540#(or (= |main_#t~malloc7.base| main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 541#(or (= main_~nondetString~0.base main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 542#(= 1 (select |#valid| |cstrcpy_#in~s1.base|)), 543#(= 1 (select |#valid| cstrcpy_~dst~0.base))] [2018-02-04 14:58:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:58:38,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:58:38,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:58:38,234 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2018-02-04 14:58:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:38,324 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 14:58:38,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:58:38,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-04 14:58:38,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:38,325 INFO L225 Difference]: With dead ends: 36 [2018-02-04 14:58:38,326 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 14:58:38,326 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 14:58:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 14:58:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 14:58:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-04 14:58:38,328 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-02-04 14:58:38,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:38,329 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-04 14:58:38,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:58:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-04 14:58:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:58:38,329 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:38,329 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:38,329 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:38,329 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-02-04 14:58:38,330 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:38,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:38,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:58:38,437 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,437 INFO L182 omatonBuilderFactory]: Interpolants [624#false, 625#(<= 1 main_~length1~0), 626#(and (= 0 |main_#t~malloc6.offset|) (<= 1 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 627#(and (<= 1 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 628#(and (<= 1 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 629#(and (<= 1 (select |#length| |cstrcpy_#in~s1.base|)) (= 0 |cstrcpy_#in~s1.offset|)), 630#(and (<= 1 (select |#length| cstrcpy_~dst~0.base)) (= 0 cstrcpy_~dst~0.offset)), 631#(and (= |cstrcpy_#t~post0.offset| 0) (<= 1 (select |#length| |cstrcpy_#t~post0.base|))), 623#true] [2018-02-04 14:58:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:58:38,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:58:38,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:58:38,438 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-02-04 14:58:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:38,560 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-04 14:58:38,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:58:38,561 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-04 14:58:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:38,561 INFO L225 Difference]: With dead ends: 38 [2018-02-04 14:58:38,561 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 14:58:38,561 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:58:38,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 14:58:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-04 14:58:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 14:58:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 14:58:38,563 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-02-04 14:58:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:38,563 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 14:58:38,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:58:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 14:58:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:58:38,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:38,564 INFO L351 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] [2018-02-04 14:58:38,564 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:38,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-02-04 14:58:38,565 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:38,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:38,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:58:38,702 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,703 INFO L182 omatonBuilderFactory]: Interpolants [720#(and (= 0 |main_#t~malloc7.offset|) (<= main_~length2~0 1) (<= 1 main_~length2~0)), 721#(and (<= 1 main_~length2~0) (= main_~nondetString~0.offset 0) (<= (+ main_~nondetString~0.offset main_~length2~0) 1)), 722#(and (= main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset))), 723#(= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|)), 724#(= 0 (select (select |#memory_int| cstrcpy_~src~0.base) cstrcpy_~src~0.offset)), 725#(= 0 (select (select |#memory_int| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post1.offset|)), 726#(= 0 |cstrcpy_#t~mem3|), 717#true, 718#false, 719#(and (<= main_~length2~0 1) (<= 1 main_~length2~0))] [2018-02-04 14:58:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:58:38,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:58:38,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:58:38,704 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-02-04 14:58:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:38,803 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-04 14:58:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 14:58:38,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-04 14:58:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:38,803 INFO L225 Difference]: With dead ends: 60 [2018-02-04 14:58:38,804 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 14:58:38,804 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-04 14:58:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 14:58:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-02-04 14:58:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 14:58:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-02-04 14:58:38,806 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-02-04 14:58:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:38,807 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-02-04 14:58:38,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:58:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-02-04 14:58:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:58:38,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:38,807 INFO L351 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] [2018-02-04 14:58:38,807 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:38,807 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-02-04 14:58:38,808 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:38,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,962 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:38,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 14:58:38,962 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,962 INFO L182 omatonBuilderFactory]: Interpolants [852#true, 853#false, 854#(<= 1 main_~length2~0), 855#(and (= 0 |main_#t~malloc7.offset|) (<= 1 main_~length2~0)), 856#(and (<= 1 main_~length2~0) (= main_~nondetString~0.offset 0)), 857#(and (or (<= 2 (select |#length| main_~nondetString~0.base)) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset))) (= 0 main_~nondetString~0.offset)), 858#(and (or (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) |cstrcpy_#in~s2.offset|)) (<= 2 (select |#length| |cstrcpy_#in~s2.base|))) (= 0 |cstrcpy_#in~s2.offset|)), 859#(and (or (= 0 (select (select |#memory_int| cstrcpy_~src~0.base) cstrcpy_~src~0.offset)) (<= 2 (select |#length| cstrcpy_~src~0.base))) (= 0 cstrcpy_~src~0.offset)), 860#(and (or (= 0 (select (select |#memory_int| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post1.offset|)) (and (<= (+ cstrcpy_~src~0.offset 1) (+ (select |#length| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post1.offset|)) (= |cstrcpy_#t~post1.base| cstrcpy_~src~0.base))) (<= (+ |cstrcpy_#t~post1.offset| 1) cstrcpy_~src~0.offset) (= |cstrcpy_#t~post1.offset| 0)), 861#(and (or (<= (+ cstrcpy_~src~0.offset 1) (select |#length| cstrcpy_~src~0.base)) (= 0 |cstrcpy_#t~mem3|)) (<= 1 cstrcpy_~src~0.offset)), 862#(and (<= (+ cstrcpy_~src~0.offset 1) (select |#length| cstrcpy_~src~0.base)) (<= 1 cstrcpy_~src~0.offset)), 863#(and (<= 1 |cstrcpy_#t~post1.offset|) (<= (+ |cstrcpy_#t~post1.offset| 1) (select |#length| |cstrcpy_#t~post1.base|)))] [2018-02-04 14:58:38,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:38,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:58:38,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:58:38,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:38,963 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 12 states. [2018-02-04 14:58:39,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:39,114 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 14:58:39,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 14:58:39,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-02-04 14:58:39,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:39,116 INFO L225 Difference]: With dead ends: 60 [2018-02-04 14:58:39,116 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 14:58:39,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-02-04 14:58:39,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 14:58:39,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-04 14:58:39,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 14:58:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-04 14:58:39,120 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-02-04 14:58:39,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:39,120 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-04 14:58:39,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:58:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-04 14:58:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 14:58:39,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:39,121 INFO L351 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] [2018-02-04 14:58:39,122 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-02-04 14:58:39,122 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:39,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,313 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:39,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 14:58:39,314 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,314 INFO L182 omatonBuilderFactory]: Interpolants [992#false, 993#(<= main_~length2~0 main_~length1~0), 994#(and (= 0 |main_#t~malloc6.offset|) (<= main_~length2~0 (select |#length| |main_#t~malloc6.base|)) (= (select |#valid| |main_#t~malloc6.base|) 1)), 995#(and (<= main_~length2~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 996#(and (= 0 |main_#t~malloc7.offset|) (<= main_~length2~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 997#(and (<= main_~length2~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetString~0.offset) (= main_~length2~0 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetArea~0.offset)), 998#(and (<= (select |#length| main_~nondetString~0.base) (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetString~0.offset) (= 0 main_~nondetArea~0.offset)), 999#(and (<= (select |#length| |cstrcpy_#in~s2.base|) (select |#length| |cstrcpy_#in~s1.base|)) (= 0 |cstrcpy_#in~s2.offset|) (= 0 |cstrcpy_#in~s1.offset|)), 1000#(and (= 0 cstrcpy_~dst~0.offset) (<= (select |#length| cstrcpy_~src~0.base) (select |#length| cstrcpy_~dst~0.base)) (= 0 cstrcpy_~src~0.offset)), 1001#(and (= |cstrcpy_#t~post0.base| cstrcpy_~dst~0.base) (<= (+ |cstrcpy_#t~post0.offset| 1) cstrcpy_~dst~0.offset) (= |cstrcpy_#t~post0.offset| 0) (<= (+ (select |#length| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post1.offset| cstrcpy_~dst~0.offset) (+ |cstrcpy_#t~post0.offset| cstrcpy_~src~0.offset (select |#length| |cstrcpy_#t~post0.base|))) (= |cstrcpy_#t~post1.offset| 0) (= |cstrcpy_#t~post1.base| cstrcpy_~src~0.base)), 1002#(and (= |cstrcpy_#t~post0.base| cstrcpy_~dst~0.base) (<= (+ |cstrcpy_#t~post0.offset| 1) cstrcpy_~dst~0.offset) (<= (+ cstrcpy_~dst~0.offset (select |#length| cstrcpy_~src~0.base)) (+ |cstrcpy_#t~post0.offset| cstrcpy_~src~0.offset (select |#length| |cstrcpy_#t~post0.base|))) (= |cstrcpy_#t~post0.offset| 0)), 1003#(and (<= 1 cstrcpy_~dst~0.offset) (<= (+ cstrcpy_~dst~0.offset (select |#length| cstrcpy_~src~0.base)) (+ (select |#length| cstrcpy_~dst~0.base) cstrcpy_~src~0.offset))), 1004#(and (<= (+ (select |#length| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post0.offset|) (+ |cstrcpy_#t~post1.offset| (select |#length| |cstrcpy_#t~post0.base|))) (<= 1 |cstrcpy_#t~post0.offset|)), 1005#(and (<= 1 |cstrcpy_#t~post0.offset|) (<= (+ |cstrcpy_#t~post0.offset| 1) (select |#length| |cstrcpy_#t~post0.base|))), 991#true] [2018-02-04 14:58:39,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 14:58:39,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 14:58:39,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:58:39,315 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 15 states. [2018-02-04 14:58:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:39,581 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-02-04 14:58:39,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 14:58:39,582 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-02-04 14:58:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:39,583 INFO L225 Difference]: With dead ends: 56 [2018-02-04 14:58:39,583 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 14:58:39,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-04 14:58:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 14:58:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 14:58:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 14:58:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-04 14:58:39,587 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-02-04 14:58:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:39,588 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-04 14:58:39,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 14:58:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-04 14:58:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 14:58:39,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:39,589 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:39,589 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:39,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1119438913, now seen corresponding path program 2 times [2018-02-04 14:58:39,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:39,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:39,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 14:58:39,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,948 INFO L182 omatonBuilderFactory]: Interpolants [1152#(or (and (<= 2 cstrcpy_~src~0.offset) (or (<= (select |#length| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post1.offset|) (<= (+ cstrcpy_~src~0.offset 1) (select |#length| cstrcpy_~src~0.base)))) (and (= 0 (select (select |#memory_int| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post1.offset|)) (= 1 |cstrcpy_#t~post1.offset|))), 1153#(or (and (<= 2 cstrcpy_~src~0.offset) (<= (+ cstrcpy_~src~0.offset 1) (select |#length| cstrcpy_~src~0.base))) (= 0 |cstrcpy_#t~mem3|)), 1154#(and (<= 2 cstrcpy_~src~0.offset) (<= (+ cstrcpy_~src~0.offset 1) (select |#length| cstrcpy_~src~0.base))), 1155#(and (<= (+ |cstrcpy_#t~post1.offset| 1) (select |#length| |cstrcpy_#t~post1.base|)) (<= 2 |cstrcpy_#t~post1.offset|)), 1140#true, 1141#false, 1142#(= (select |#valid| |main_#t~malloc6.base|) 1), 1143#(= (select |#valid| main_~nondetArea~0.base) 1), 1144#(and (= 0 |main_#t~malloc7.offset|) (not (= main_~nondetArea~0.base |main_#t~malloc7.base|)) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1145#(and (or (= (+ main_~nondetString~0.offset main_~length2~0) 2) (= main_~length2~0 (select |#length| main_~nondetString~0.base))) (or (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (not (= (+ main_~nondetString~0.offset main_~length2~0) 2))) (= 0 main_~nondetString~0.offset)), 1146#(and (or (<= (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base)) 1) (and (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= 0 (select (select |#memory_int| main_~nondetString~0.base) 1))) (<= 3 (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base)))) (= 0 main_~nondetString~0.offset)), 1147#(and (= 0 |cstrcpy_#in~s2.offset|) (or (<= (select |#length| |cstrcpy_#in~s2.base|) 1) (<= 3 (select |#length| |cstrcpy_#in~s2.base|)) (and (not (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) 1))))), 1148#(and (or (and (= 0 (select (select |#memory_int| cstrcpy_~src~0.base) 1)) (not (= cstrcpy_~dst~0.base cstrcpy_~src~0.base))) (<= (select |#length| cstrcpy_~src~0.base) 1) (<= 3 (select |#length| cstrcpy_~src~0.base))) (= 0 cstrcpy_~src~0.offset)), 1149#(and (= |cstrcpy_#t~post1.offset| 0) (or (and (not (= |cstrcpy_#t~post1.base| |cstrcpy_#t~post0.base|)) (= 0 (select (select |#memory_int| |cstrcpy_#t~post1.base|) 1)) (<= (+ |cstrcpy_#t~post1.offset| 1) cstrcpy_~src~0.offset) (<= cstrcpy_~src~0.offset (+ |cstrcpy_#t~post1.offset| 1)) (= |cstrcpy_#t~post1.base| cstrcpy_~src~0.base)) (and (<= (+ |cstrcpy_#t~post1.offset| 1) cstrcpy_~src~0.offset) (or (<= (+ cstrcpy_~src~0.offset 2) (+ (select |#length| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post1.offset|)) (<= (+ (select |#length| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post1.offset|) cstrcpy_~src~0.offset)) (= |cstrcpy_#t~post1.base| cstrcpy_~src~0.base)))), 1150#(or (and (or (<= (+ cstrcpy_~src~0.offset 2) (select |#length| cstrcpy_~src~0.base)) (<= (select |#length| cstrcpy_~src~0.base) cstrcpy_~src~0.offset)) (<= 1 cstrcpy_~src~0.offset)) (and (<= cstrcpy_~src~0.offset 1) (= 0 (select (select (store |#memory_int| |cstrcpy_#t~post0.base| (store (select |#memory_int| |cstrcpy_#t~post0.base|) |cstrcpy_#t~post0.offset| |cstrcpy_#t~mem3|)) cstrcpy_~src~0.base) 1)) (<= 1 cstrcpy_~src~0.offset))), 1151#(or (and (<= cstrcpy_~src~0.offset 1) (<= 1 cstrcpy_~src~0.offset) (= 0 (select (select |#memory_int| cstrcpy_~src~0.base) 1))) (and (or (<= (+ cstrcpy_~src~0.offset 2) (select |#length| cstrcpy_~src~0.base)) (<= (select |#length| cstrcpy_~src~0.base) cstrcpy_~src~0.offset)) (<= 1 cstrcpy_~src~0.offset)))] [2018-02-04 14:58:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:39,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 14:58:39,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 14:58:39,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 14:58:39,948 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 16 states. [2018-02-04 14:58:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:40,293 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-04 14:58:40,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 14:58:40,294 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-02-04 14:58:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:40,294 INFO L225 Difference]: With dead ends: 66 [2018-02-04 14:58:40,294 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 14:58:40,295 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-02-04 14:58:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 14:58:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2018-02-04 14:58:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-04 14:58:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-04 14:58:40,299 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 29 [2018-02-04 14:58:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:40,299 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-04 14:58:40,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 14:58:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-04 14:58:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 14:58:40,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:40,300 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:40,300 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash 216235552, now seen corresponding path program 1 times [2018-02-04 14:58:40,301 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:40,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:40,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:40,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:58:40,367 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:40,367 INFO L182 omatonBuilderFactory]: Interpolants [1299#true, 1300#false, 1301#(= |#valid| |old(#valid)|), 1302#(and (= (store |#valid| |main_#t~malloc6.base| 0) |old(#valid)|) (= (select |#valid| |main_#t~malloc6.base|) 1)), 1303#(and (= |old(#valid)| (store (store |#valid| |main_#t~malloc7.base| 0) |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|))) (not (= |main_#t~malloc6.base| |main_#t~malloc7.base|))), 1304#(= (store |#valid| |main_#t~malloc7.base| 0) |old(#valid)|)] [2018-02-04 14:58:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:40,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:58:40,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:58:40,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:40,368 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-02-04 14:58:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:40,410 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 14:58:40,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:58:40,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 14:58:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:40,410 INFO L225 Difference]: With dead ends: 60 [2018-02-04 14:58:40,411 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 14:58:40,411 INFO L554 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-02-04 14:58:40,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 14:58:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-04 14:58:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-04 14:58:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-02-04 14:58:40,413 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-02-04 14:58:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:40,413 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-02-04 14:58:40,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:58:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-02-04 14:58:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 14:58:40,414 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:40,414 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:40,414 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash 678185859, now seen corresponding path program 3 times [2018-02-04 14:58:40,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:40,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:40,653 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:58:40,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:40,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 14:58:40,654 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:40,655 INFO L182 omatonBuilderFactory]: Interpolants [1408#(and (= 0 |main_#t~malloc7.offset|) (not (= main_~nondetArea~0.base |main_#t~malloc7.base|)) (= main_~length2~0 (select |#length| |main_#t~malloc7.base|))), 1409#(and (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= main_~length2~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0)), 1410#(and (= 0 (select (select |#memory_int| main_~nondetString~0.base) (+ main_~nondetString~0.offset (+ (select |#length| main_~nondetString~0.base) (- 1))))) (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= main_~nondetString~0.offset 0)), 1411#(and (not (= |cstrcpy_#in~s1.base| |cstrcpy_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrcpy_#in~s2.base|) (+ (select |#length| |cstrcpy_#in~s2.base|) (- 1))))), 1412#(and (= 0 (select (select |#memory_int| cstrcpy_~src~0.base) (+ (select |#length| cstrcpy_~src~0.base) (- 1)))) (not (= cstrcpy_~dst~0.base cstrcpy_~src~0.base))), 1413#(and (not (= |cstrcpy_#t~post1.base| |cstrcpy_#t~post0.base|)) (not (= cstrcpy_~dst~0.base |cstrcpy_#t~post1.base|)) (= 0 (select (select |#memory_int| |cstrcpy_#t~post1.base|) (+ (select |#length| |cstrcpy_#t~post1.base|) (- 1)))) (= |cstrcpy_#t~post1.base| cstrcpy_~src~0.base)), 1414#(and (= 0 (select (select (store |#memory_int| |cstrcpy_#t~post0.base| (store (select |#memory_int| |cstrcpy_#t~post0.base|) |cstrcpy_#t~post0.offset| |cstrcpy_#t~mem3|)) cstrcpy_~src~0.base) (+ (select |#length| cstrcpy_~src~0.base) (- 1)))) (not (= cstrcpy_~dst~0.base cstrcpy_~src~0.base))), 1415#(and (not (= |cstrcpy_#t~post0.base| cstrcpy_~src~0.base)) (= 0 (select (select |#memory_int| cstrcpy_~src~0.base) (+ (select |#length| cstrcpy_~src~0.base) (- 1))))), 1416#(= 0 (select (select (store |#memory_int| |cstrcpy_#t~post0.base| (store (select |#memory_int| |cstrcpy_#t~post0.base|) |cstrcpy_#t~post0.offset| |cstrcpy_#t~mem3|)) cstrcpy_~src~0.base) (+ (select |#length| cstrcpy_~src~0.base) (- 1)))), 1417#(= 0 (select (select |#memory_int| cstrcpy_~src~0.base) (+ (select |#length| cstrcpy_~src~0.base) (- 1)))), 1418#(or (and (<= (+ |cstrcpy_#t~post1.offset| 1) cstrcpy_~src~0.offset) (or (<= (select |#length| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post1.offset|) (<= (+ cstrcpy_~src~0.offset 1) (select |#length| cstrcpy_~src~0.base)))) (= 0 (select (select |#memory_int| |cstrcpy_#t~post1.base|) |cstrcpy_#t~post1.offset|))), 1419#(or (and (<= (+ cstrcpy_~src~0.offset 1) (select |#length| cstrcpy_~src~0.base)) (<= 1 cstrcpy_~src~0.offset)) (= 0 |cstrcpy_#t~mem3|)), 1420#(and (<= (+ cstrcpy_~src~0.offset 1) (select |#length| cstrcpy_~src~0.base)) (<= 1 cstrcpy_~src~0.offset)), 1421#(and (<= 1 |cstrcpy_#t~post1.offset|) (<= (+ |cstrcpy_#t~post1.offset| 1) (select |#length| |cstrcpy_#t~post1.base|))), 1404#true, 1405#false, 1406#(= (select |#valid| |main_#t~malloc6.base|) 1), 1407#(= (select |#valid| main_~nondetArea~0.base) 1)] [2018-02-04 14:58:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:58:40,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 14:58:40,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 14:58:40,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:58:40,656 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-02-04 14:58:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:40,950 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-02-04 14:58:40,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 14:58:40,950 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-02-04 14:58:40,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:40,951 INFO L225 Difference]: With dead ends: 34 [2018-02-04 14:58:40,951 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:58:40,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2018-02-04 14:58:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:58:40,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:58:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:58:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:58:40,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-02-04 14:58:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:40,952 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:58:40,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 14:58:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:58:40,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:58:40,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:58:40 BoogieIcfgContainer [2018-02-04 14:58:40,956 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:58:40,957 INFO L168 Benchmark]: Toolchain (without parser) took 4116.19 ms. Allocated memory was 403.7 MB in the beginning and 683.1 MB in the end (delta: 279.4 MB). Free memory was 361.9 MB in the beginning and 448.5 MB in the end (delta: -86.6 MB). Peak memory consumption was 192.8 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:40,958 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:58:40,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.80 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 351.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:40,958 INFO L168 Benchmark]: Boogie Preprocessor took 22.48 ms. Allocated memory is still 403.7 MB. Free memory was 351.3 MB in the beginning and 348.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:40,958 INFO L168 Benchmark]: RCFGBuilder took 178.41 ms. Allocated memory is still 403.7 MB. Free memory was 348.7 MB in the beginning and 332.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:40,959 INFO L168 Benchmark]: TraceAbstraction took 3770.56 ms. Allocated memory was 403.7 MB in the beginning and 683.1 MB in the end (delta: 279.4 MB). Free memory was 330.7 MB in the beginning and 448.5 MB in the end (delta: -117.8 MB). Peak memory consumption was 161.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:58:40,959 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.13 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 141.80 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 351.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.48 ms. Allocated memory is still 403.7 MB. Free memory was 351.3 MB in the beginning and 348.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 178.41 ms. Allocated memory is still 403.7 MB. Free memory was 348.7 MB in the beginning and 332.0 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3770.56 ms. Allocated memory was 403.7 MB in the beginning and 683.1 MB in the end (delta: 279.4 MB). Free memory was 330.7 MB in the beginning and 448.5 MB in the end (delta: -117.8 MB). Peak memory consumption was 161.6 MB. Max. memory is 5.3 GB. * 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: 548]: 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 - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 3.7s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 379 SDtfs, 394 SDslu, 1526 SDs, 0 SdLazy, 1357 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 5/45 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 23 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 49451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 5/45 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-58-40-965.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-58-40-965.csv Received shutdown request...