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/cav18-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-26d9e06-m [2018-02-02 09:47:42,513 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:47:42,514 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:47:42,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:47:42,524 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:47:42,525 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:47:42,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:47:42,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:47:42,528 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:47:42,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:47:42,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:47:42,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:47:42,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:47:42,532 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:47:42,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:47:42,534 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:47:42,535 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:47:42,537 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:47:42,538 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:47:42,539 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:47:42,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:47:42,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:47:42,541 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:47:42,542 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:47:42,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:47:42,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:47:42,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:47:42,544 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:47:42,544 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:47:42,544 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:47:42,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:47:42,545 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:47:42,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:47:42,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:47:42,556 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:47:42,557 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:47:42,557 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:47:42,557 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:47:42,557 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:47:42,557 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:47:42,557 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:47:42,558 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:47:42,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:47:42,558 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:47:42,558 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:47:42,558 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:47:42,558 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:47:42,558 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:47:42,559 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:47:42,559 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:47:42,559 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:47:42,559 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:47:42,559 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:47:42,559 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:47:42,559 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:47:42,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:47:42,597 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:47:42,603 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:47:42,605 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:47:42,605 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:47:42,606 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-02 09:47:42,720 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:47:42,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:47:42,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:47:42,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:47:42,728 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:47:42,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:47:42" (1/1) ... [2018-02-02 09:47:42,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421f655e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42, skipping insertion in model container [2018-02-02 09:47:42,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:47:42" (1/1) ... [2018-02-02 09:47:42,746 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:47:42,775 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:47:42,866 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:47:42,878 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:47:42,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42 WrapperNode [2018-02-02 09:47:42,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:47:42,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:47:42,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:47:42,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:47:42,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42" (1/1) ... [2018-02-02 09:47:42,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42" (1/1) ... [2018-02-02 09:47:42,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42" (1/1) ... [2018-02-02 09:47:42,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42" (1/1) ... [2018-02-02 09:47:42,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42" (1/1) ... [2018-02-02 09:47:42,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42" (1/1) ... [2018-02-02 09:47:42,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42" (1/1) ... [2018-02-02 09:47:42,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:47:42,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:47:42,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:47:42,907 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:47:42,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42" (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-02 09:47:42,943 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:47:42,943 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:47:42,943 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-02-02 09:47:42,943 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:47:42,943 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:47:42,943 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:47:42,943 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:47:42,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:47:42,944 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:47:42,944 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:47:42,944 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-02-02 09:47:42,944 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:47:42,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:47:42,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:47:43,095 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:47:43,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:47:43 BoogieIcfgContainer [2018-02-02 09:47:43,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:47:43,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:47:43,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:47:43,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:47:43,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:47:42" (1/3) ... [2018-02-02 09:47:43,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88d8b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:47:43, skipping insertion in model container [2018-02-02 09:47:43,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:47:42" (2/3) ... [2018-02-02 09:47:43,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88d8b6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:47:43, skipping insertion in model container [2018-02-02 09:47:43,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:47:43" (3/3) ... [2018-02-02 09:47:43,102 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:47:43,109 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:47:43,115 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-02 09:47:43,148 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:47:43,148 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:47:43,148 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:47:43,148 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:47:43,148 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:47:43,149 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:47:43,149 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:47:43,149 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:47:43,149 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:47:43,158 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-02 09:47:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 09:47:43,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:43,166 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:43,166 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-02-02 09:47:43,201 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:43,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:43,287 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-02 09:47:43,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:43,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:47:43,289 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:43,290 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-02 09:47:43,290 INFO L182 omatonBuilderFactory]: Interpolants [43#true, 44#false, 45#(<= 1 main_~length1~0), 46#(<= main_~length2~0 main_~length1~0)] [2018-02-02 09:47:43,290 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-02 09:47:43,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:47:43,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:47:43,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:47:43,300 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-02 09:47:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:43,357 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-02 09:47:43,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:47:43,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 09:47:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:43,412 INFO L225 Difference]: With dead ends: 44 [2018-02-02 09:47:43,412 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 09:47:43,413 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-02 09:47:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 09:47:43,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-02 09:47:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 09:47:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-02 09:47:43,436 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-02-02 09:47:43,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:43,436 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-02 09:47:43,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:47:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-02 09:47:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 09:47:43,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:43,437 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:43,437 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:43,437 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-02-02 09:47:43,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:43,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:43,465 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-02 09:47:43,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:43,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:47:43,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:43,465 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-02 09:47:43,466 INFO L182 omatonBuilderFactory]: Interpolants [131#true, 132#false, 133#(= |#valid| |old(#valid)|)] [2018-02-02 09:47:43,466 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-02 09:47:43,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:47:43,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:47:43,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:47:43,467 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-02-02 09:47:43,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:43,499 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-02 09:47:43,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:47:43,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-02 09:47:43,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:43,500 INFO L225 Difference]: With dead ends: 39 [2018-02-02 09:47:43,500 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 09:47:43,501 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-02 09:47:43,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 09:47:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-02 09:47:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 09:47:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-02 09:47:43,504 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-02-02 09:47:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:43,505 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-02 09:47:43,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:47:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-02 09:47:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:47:43,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:43,506 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:43,506 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:43,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-02-02 09:47:43,507 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:43,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:43,550 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-02 09:47:43,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:43,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:47:43,551 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:43,551 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-02 09:47:43,551 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-02 09:47:43,552 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-02 09:47:43,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:47:43,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:47:43,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:47:43,552 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-02-02 09:47:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:43,590 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-02 09:47:43,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:47:43,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 09:47:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:43,591 INFO L225 Difference]: With dead ends: 36 [2018-02-02 09:47:43,591 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 09:47:43,592 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-02 09:47:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 09:47:43,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 09:47:43,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 09:47:43,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-02 09:47:43,595 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-02-02 09:47:43,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:43,595 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-02 09:47:43,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:47:43,596 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-02 09:47:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:47:43,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:43,596 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:47:43,596 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-02-02 09:47:43,597 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:43,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:43,668 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-02 09:47:43,668 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:43,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:47:43,669 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:43,669 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-02 09:47:43,669 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-02 09:47:43,669 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-02 09:47:43,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:47:43,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:47:43,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:47:43,670 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-02 09:47:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:43,707 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-02 09:47:43,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:47:43,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 09:47:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:43,708 INFO L225 Difference]: With dead ends: 35 [2018-02-02 09:47:43,708 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 09:47:43,708 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-02 09:47:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 09:47:43,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 09:47:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 09:47:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-02 09:47:43,710 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-02-02 09:47:43,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:43,710 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-02 09:47:43,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:47:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-02 09:47:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:47:43,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:43,711 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-02 09:47:43,711 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:43,711 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-02-02 09:47:43,712 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:43,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:43,752 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-02 09:47:43,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:43,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:47:43,753 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:43,753 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-02 09:47:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:43,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:47:43,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:47:43,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:47:43,754 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-02-02 09:47:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:43,811 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-02 09:47:43,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:47:43,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-02 09:47:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:43,812 INFO L225 Difference]: With dead ends: 34 [2018-02-02 09:47:43,812 INFO L226 Difference]: Without dead ends: 34 [2018-02-02 09:47:43,812 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-02 09:47:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-02 09:47:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-02 09:47:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-02 09:47:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-02 09:47:43,815 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-02-02 09:47:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:43,816 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-02 09:47:43,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:47:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-02 09:47:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:47:43,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:43,816 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-02 09:47:43,816 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:43,816 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-02-02 09:47:43,817 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:43,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:43,907 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-02 09:47:43,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:43,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:47:43,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:43,908 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-02 09:47:43,908 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-02 09:47:43,908 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-02 09:47:43,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:47:43,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:47:43,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:47:43,909 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-02-02 09:47:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:44,037 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-02 09:47:44,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:47:44,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 09:47:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:44,038 INFO L225 Difference]: With dead ends: 41 [2018-02-02 09:47:44,038 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 09:47:44,038 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-02 09:47:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 09:47:44,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-02-02 09:47:44,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 09:47:44,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-02 09:47:44,041 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-02-02 09:47:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:44,041 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-02 09:47:44,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:47:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-02 09:47:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:47:44,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:44,045 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-02 09:47:44,045 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-02-02 09:47:44,046 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:44,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:44,126 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-02 09:47:44,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:44,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:47:44,127 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:44,127 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-02 09:47:44,127 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-02 09:47:44,127 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-02 09:47:44,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:47:44,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:47:44,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:47:44,128 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2018-02-02 09:47:44,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:44,189 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-02 09:47:44,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:47:44,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-02 09:47:44,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:44,190 INFO L225 Difference]: With dead ends: 36 [2018-02-02 09:47:44,190 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 09:47:44,191 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-02 09:47:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 09:47:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 09:47:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 09:47:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-02 09:47:44,192 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-02-02 09:47:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:44,193 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-02 09:47:44,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:47:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-02 09:47:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:47:44,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:44,193 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-02 09:47:44,193 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-02-02 09:47:44,194 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:44,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:44,309 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-02 09:47:44,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:44,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:47:44,309 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:44,310 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-02 09:47:44,310 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-02 09:47:44,310 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-02 09:47:44,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:47:44,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:47:44,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:47:44,313 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-02-02 09:47:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:44,427 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-02 09:47:44,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:47:44,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-02 09:47:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:44,428 INFO L225 Difference]: With dead ends: 38 [2018-02-02 09:47:44,428 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 09:47:44,428 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-02 09:47:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 09:47:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-02 09:47:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 09:47:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-02 09:47:44,430 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-02-02 09:47:44,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:44,431 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-02 09:47:44,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:47:44,431 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-02 09:47:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:47:44,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:44,431 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-02 09:47:44,431 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-02-02 09:47:44,432 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:44,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:44,561 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-02 09:47:44,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:44,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:47:44,561 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:44,562 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-02 09:47:44,562 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-02 09:47:44,562 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-02 09:47:44,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:47:44,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:47:44,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:47:44,563 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-02-02 09:47:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:44,684 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-02 09:47:44,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:47:44,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-02 09:47:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:44,685 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:47:44,685 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 09:47:44,685 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-02 09:47:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 09:47:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-02-02 09:47:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 09:47:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-02-02 09:47:44,689 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-02-02 09:47:44,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:44,689 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-02-02 09:47:44,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:47:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-02-02 09:47:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:47:44,690 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:44,690 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-02 09:47:44,690 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:44,690 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-02-02 09:47:44,691 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:44,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:44,842 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-02 09:47:44,842 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:44,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 09:47:44,842 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:44,842 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-02 09:47:44,842 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-02 09:47:44,842 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-02 09:47:44,843 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:47:44,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:47:44,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:47:44,843 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 12 states. [2018-02-02 09:47:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:44,990 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-02 09:47:44,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:47:44,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-02-02 09:47:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:44,992 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:47:44,993 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 09:47:44,993 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-02 09:47:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 09:47:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-02 09:47:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 09:47:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-02 09:47:44,996 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-02-02 09:47:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:44,997 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-02 09:47:44,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:47:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-02 09:47:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 09:47:44,997 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:44,997 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-02 09:47:44,997 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-02-02 09:47:44,998 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:45,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:45,248 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-02 09:47:45,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:45,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:47:45,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:45,249 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-02 09:47:45,250 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-02 09:47:45,250 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-02 09:47:45,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:47:45,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:47:45,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:47:45,251 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 15 states. [2018-02-02 09:47:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:45,530 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-02-02 09:47:45,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:47:45,531 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-02-02 09:47:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:45,532 INFO L225 Difference]: With dead ends: 56 [2018-02-02 09:47:45,532 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 09:47:45,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:47:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 09:47:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 09:47:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 09:47:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 09:47:45,536 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-02-02 09:47:45,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:45,537 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 09:47:45,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:47:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 09:47:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 09:47:45,538 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:45,538 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-02 09:47:45,538 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:45,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1119438913, now seen corresponding path program 2 times [2018-02-02 09:47:45,539 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:45,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:45,908 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-02 09:47:45,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:45,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:47:45,908 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:45,909 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-02 09:47:45,909 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-02 09:47:45,909 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-02 09:47:45,909 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:47:45,909 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:47:45,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:47:45,910 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 16 states. [2018-02-02 09:47:46,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:46,199 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-02-02 09:47:46,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:47:46,199 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-02-02 09:47:46,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:46,200 INFO L225 Difference]: With dead ends: 66 [2018-02-02 09:47:46,200 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 09:47:46,200 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-02 09:47:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 09:47:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2018-02-02 09:47:46,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 09:47:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-02-02 09:47:46,205 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 29 [2018-02-02 09:47:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:46,205 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-02-02 09:47:46,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:47:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-02-02 09:47:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:47:46,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:46,207 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-02 09:47:46,207 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:46,207 INFO L82 PathProgramCache]: Analyzing trace with hash 216235552, now seen corresponding path program 1 times [2018-02-02 09:47:46,208 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:46,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:47:46,280 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:47:46,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:47:46,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:46,280 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-02 09:47:46,280 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-02 09:47:46,280 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-02 09:47:46,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:47:46,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:47:46,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:47:46,281 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-02-02 09:47:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:46,338 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-02 09:47:46,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:47:46,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 09:47:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:46,339 INFO L225 Difference]: With dead ends: 60 [2018-02-02 09:47:46,339 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 09:47:46,340 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-02 09:47:46,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 09:47:46,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-02 09:47:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-02 09:47:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-02-02 09:47:46,341 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-02-02 09:47:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:46,342 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-02-02 09:47:46,342 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:47:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-02-02 09:47:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 09:47:46,343 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:47:46,343 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-02 09:47:46,343 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:47:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash 678185859, now seen corresponding path program 3 times [2018-02-02 09:47:46,344 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:47:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:47:46,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:47:46,539 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-02 09:47:46,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:47:46,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-02 09:47:46,540 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:47:46,540 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-02 09:47:46,540 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-02 09:47:46,540 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-02 09:47:46,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:47:46,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:47:46,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:47:46,541 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-02-02 09:47:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:47:46,807 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-02-02 09:47:46,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:47:46,807 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-02-02 09:47:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:47:46,808 INFO L225 Difference]: With dead ends: 34 [2018-02-02 09:47:46,808 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:47:46,808 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-02 09:47:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:47:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:47:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:47:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:47:46,809 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-02-02 09:47:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:47:46,809 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:47:46,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:47:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:47:46,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:47:46,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:47:46 BoogieIcfgContainer [2018-02-02 09:47:46,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:47:46,813 INFO L168 Benchmark]: Toolchain (without parser) took 4092.66 ms. Allocated memory was 400.0 MB in the beginning and 675.3 MB in the end (delta: 275.3 MB). Free memory was 358.2 MB in the beginning and 462.0 MB in the end (delta: -103.8 MB). Peak memory consumption was 171.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:46,814 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:47:46,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.49 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 347.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:46,814 INFO L168 Benchmark]: Boogie Preprocessor took 23.92 ms. Allocated memory is still 400.0 MB. Free memory was 347.7 MB in the beginning and 345.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:46,814 INFO L168 Benchmark]: RCFGBuilder took 189.37 ms. Allocated memory is still 400.0 MB. Free memory was 345.0 MB in the beginning and 328.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:46,814 INFO L168 Benchmark]: TraceAbstraction took 3715.74 ms. Allocated memory was 400.0 MB in the beginning and 675.3 MB in the end (delta: 275.3 MB). Free memory was 327.0 MB in the beginning and 462.0 MB in the end (delta: -135.0 MB). Peak memory consumption was 140.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:47:46,815 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.17 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.49 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 347.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.92 ms. Allocated memory is still 400.0 MB. Free memory was 347.7 MB in the beginning and 345.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 189.37 ms. Allocated memory is still 400.0 MB. Free memory was 345.0 MB in the beginning and 328.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3715.74 ms. Allocated memory was 400.0 MB in the beginning and 675.3 MB in the end (delta: 275.3 MB). Free memory was 327.0 MB in the beginning and 462.0 MB in the end (delta: -135.0 MB). Peak memory consumption was 140.2 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.6s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 1.7s 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-02_09-47-46-819.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-02_09-47-46-819.csv Received shutdown request...