java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:58:54,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:58:54,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:58:54,224 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:58:54,224 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:58:54,225 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:58:54,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:58:54,228 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:58:54,229 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:58:54,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:58:54,231 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:58:54,231 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:58:54,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:58:54,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:58:54,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:58:54,235 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:58:54,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:58:54,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:58:54,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:58:54,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:58:54,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:58:54,241 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:58:54,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:58:54,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:58:54,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:58:54,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:58:54,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:58:54,245 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:58:54,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:58:54,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:58:54,246 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:58:54,246 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 14:58:54,255 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:58:54,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:58:54,256 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:58:54,256 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:58:54,256 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:58:54,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:58:54,257 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:58:54,257 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:58:54,257 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:58:54,257 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:58:54,257 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:58:54,258 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:58:54,258 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:58:54,258 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:58:54,258 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:58:54,258 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:58:54,258 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:58:54,258 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:58:54,259 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:58:54,259 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:58:54,259 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:58:54,259 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 14:58:54,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:58:54,297 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:58:54,300 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:58:54,301 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:58:54,302 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:58:54,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:58:54,455 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:58:54,457 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:58:54,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:58:54,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:58:54,461 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:58:54,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:54" (1/1) ... [2018-02-04 14:58:54,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4762d03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54, skipping insertion in model container [2018-02-04 14:58:54,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:58:54" (1/1) ... [2018-02-04 14:58:54,477 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:58:54,505 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:58:54,588 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:58:54,600 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:58:54,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54 WrapperNode [2018-02-04 14:58:54,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:58:54,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:58:54,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:58:54,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:58:54,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54" (1/1) ... [2018-02-04 14:58:54,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54" (1/1) ... [2018-02-04 14:58:54,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54" (1/1) ... [2018-02-04 14:58:54,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54" (1/1) ... [2018-02-04 14:58:54,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54" (1/1) ... [2018-02-04 14:58:54,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54" (1/1) ... [2018-02-04 14:58:54,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54" (1/1) ... [2018-02-04 14:58:54,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:58:54,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:58:54,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:58:54,629 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:58:54,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:58:54,670 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:58:54,670 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:58:54,670 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-02-04 14:58:54,670 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:58:54,671 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:58:54,671 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:58:54,671 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:58:54,671 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:58:54,671 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:58:54,671 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:58:54,671 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-02-04 14:58:54,672 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:58:54,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:58:54,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:58:54,844 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:58:54,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:54 BoogieIcfgContainer [2018-02-04 14:58:54,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:58:54,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:58:54,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:58:54,848 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:58:54,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:58:54" (1/3) ... [2018-02-04 14:58:54,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e9408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:54, skipping insertion in model container [2018-02-04 14:58:54,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:58:54" (2/3) ... [2018-02-04 14:58:54,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f0e9408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:58:54, skipping insertion in model container [2018-02-04 14:58:54,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:58:54" (3/3) ... [2018-02-04 14:58:54,850 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:58:54,858 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:58:54,863 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 14:58:54,885 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:58:54,885 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:58:54,885 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 14:58:54,885 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 14:58:54,885 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:58:54,885 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:58:54,885 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:58:54,885 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:58:54,886 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:58:54,895 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 14:58:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 14:58:54,903 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:54,904 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:54,904 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:54,908 INFO L82 PathProgramCache]: Analyzing trace with hash 118579097, now seen corresponding path program 1 times [2018-02-04 14:58:54,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:54,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:55,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:58:55,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,039 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= 1 (select |#valid| |main_#t~malloc11.base|)), 52#(= 1 (select |#valid| main_~nondetString~0.base))] [2018-02-04 14:58:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:58:55,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:58:55,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:58:55,054 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-02-04 14:58:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:55,196 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-02-04 14:58:55,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 14:58:55,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 14:58:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:55,202 INFO L225 Difference]: With dead ends: 45 [2018-02-04 14:58:55,202 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 14:58:55,203 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:55,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 14:58:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 14:58:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 14:58:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 14:58:55,224 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-02-04 14:58:55,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:55,225 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 14:58:55,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:58:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 14:58:55,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 14:58:55,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:55,225 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:55,225 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:55,225 INFO L82 PathProgramCache]: Analyzing trace with hash 118579098, now seen corresponding path program 1 times [2018-02-04 14:58:55,226 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:55,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,328 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:55,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 14:58:55,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,329 INFO L182 omatonBuilderFactory]: Interpolants [144#(<= 1 main_~length~0), 145#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 146#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0) (<= 1 main_~length~0)), 142#true, 143#false] [2018-02-04 14:58:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:58:55,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:58:55,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:55,331 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-02-04 14:58:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:55,369 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-02-04 14:58:55,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:58:55,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 14:58:55,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:55,370 INFO L225 Difference]: With dead ends: 41 [2018-02-04 14:58:55,371 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 14:58:55,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 14:58:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 14:58:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 14:58:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 14:58:55,375 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 13 [2018-02-04 14:58:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:55,375 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 14:58:55,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:58:55,376 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 14:58:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 14:58:55,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:55,376 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:55,376 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash -539609344, now seen corresponding path program 1 times [2018-02-04 14:58:55,377 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:55,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:55,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:58:55,438 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,439 INFO L182 omatonBuilderFactory]: Interpolants [231#true, 232#false, 233#(= 1 (select |#valid| main_~nondetString~0.base)), 234#(= 1 (select |#valid| |cstrncpy_#in~s2.base|)), 235#(= 1 (select |#valid| cstrncpy_~src~0.base)), 236#(= 1 (select |#valid| |cstrncpy_#t~post2.base|))] [2018-02-04 14:58:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:58:55,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:58:55,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:55,440 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2018-02-04 14:58:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:55,510 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-02-04 14:58:55,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 14:58:55,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 14:58:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:55,511 INFO L225 Difference]: With dead ends: 40 [2018-02-04 14:58:55,511 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 14:58:55,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:58:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 14:58:55,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 14:58:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 14:58:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-02-04 14:58:55,513 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2018-02-04 14:58:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:55,514 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-02-04 14:58:55,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:58:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-02-04 14:58:55,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 14:58:55,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:55,514 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:55,514 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash -539609343, now seen corresponding path program 1 times [2018-02-04 14:58:55,515 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:55,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:55,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:55,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:58:55,611 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,611 INFO L182 omatonBuilderFactory]: Interpolants [321#true, 322#false, 323#(<= 1 main_~length~0), 324#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 325#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset) (<= 1 main_~length~0)), 326#(and (<= 1 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset)), 327#(and (<= 1 (select |#length| |cstrncpy_#in~s2.base|)) (= 0 |cstrncpy_#in~s2.offset|)), 328#(and (= 0 cstrncpy_~src~0.offset) (<= 1 (select |#length| cstrncpy_~src~0.base))), 329#(and (= |cstrncpy_#t~post2.offset| 0) (<= 1 (select |#length| |cstrncpy_#t~post2.base|)))] [2018-02-04 14:58:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:58:55,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:58:55,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:58:55,612 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2018-02-04 14:58:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:55,754 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-02-04 14:58:55,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:58:55,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-04 14:58:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:55,757 INFO L225 Difference]: With dead ends: 50 [2018-02-04 14:58:55,757 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 14:58:55,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 14:58:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-02-04 14:58:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 14:58:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-04 14:58:55,762 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2018-02-04 14:58:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:55,762 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-04 14:58:55,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:58:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-04 14:58:55,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:58:55,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:55,763 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:55,763 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:55,763 INFO L82 PathProgramCache]: Analyzing trace with hash 451979505, now seen corresponding path program 1 times [2018-02-04 14:58:55,764 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:55,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:55,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:55,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:58:55,907 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:55,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-04 14:58:55,907 INFO L182 omatonBuilderFactory]: Interpolants [432#(and (= 0 |main_#t~malloc10.offset|) (<= 1 main_~n~0) (= main_~n~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 433#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 434#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 435#(and (<= 1 (select |#length| |cstrncpy_#in~s1.base|)) (= 0 |cstrncpy_#in~s1.offset|)), 436#(and (= 0 cstrncpy_~dst~0.offset) (<= 1 (select |#length| cstrncpy_~dst~0.base))), 437#(and (= |cstrncpy_#t~post1.offset| 0) (<= 1 (select |#length| |cstrncpy_#t~post1.base|))), 429#true, 430#false, 431#(<= 1 main_~n~0)] [2018-02-04 14:58:55,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-04 14:58:55,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:58:55,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:58:55,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:58:55,908 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 9 states. [2018-02-04 14:58:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:56,056 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-04 14:58:56,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 14:58:56,057 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 14:58:56,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:56,058 INFO L225 Difference]: With dead ends: 49 [2018-02-04 14:58:56,058 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 14:58:56,060 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:56,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 14:58:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-02-04 14:58:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 14:58:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-02-04 14:58:56,066 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 19 [2018-02-04 14:58:56,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:56,066 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-02-04 14:58:56,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:58:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-02-04 14:58:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 14:58:56,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:56,067 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:56,067 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:56,068 INFO L82 PathProgramCache]: Analyzing trace with hash 451979504, now seen corresponding path program 1 times [2018-02-04 14:58:56,069 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:56,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:56,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:58:56,169 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,169 INFO L182 omatonBuilderFactory]: Interpolants [544#(= 1 (select |#valid| cstrncpy_~dst~0.base)), 545#(= (select |#valid| |cstrncpy_#t~post1.base|) 1), 537#true, 538#false, 539#(= 1 (select |#valid| |main_#t~malloc10.base|)), 540#(= 1 (select |#valid| main_~nondetArea~0.base)), 541#(or (= |main_#t~malloc11.base| main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 542#(or (= main_~nondetString~0.base main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 543#(= 1 (select |#valid| |cstrncpy_#in~s1.base|))] [2018-02-04 14:58:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:58:56,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:58:56,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:58:56,170 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 9 states. [2018-02-04 14:58:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:56,253 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-04 14:58:56,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:58:56,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 14:58:56,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:56,253 INFO L225 Difference]: With dead ends: 43 [2018-02-04 14:58:56,253 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 14:58:56,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 14:58:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 14:58:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 14:58:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-04 14:58:56,257 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-02-04 14:58:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:56,257 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-04 14:58:56,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:58:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-04 14:58:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:58:56,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:56,257 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] [2018-02-04 14:58:56,258 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:56,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1872127023, now seen corresponding path program 1 times [2018-02-04 14:58:56,258 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:56,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:56,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 14:58:56,299 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,299 INFO L182 omatonBuilderFactory]: Interpolants [640#(<= main_~n~0 1), 641#(<= |cstrncpy_#in~n| 1), 642#(<= cstrncpy_~n 1), 643#(<= cstrncpy_~n 0), 638#true, 639#false] [2018-02-04 14:58:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:58:56,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:58:56,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:56,300 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 6 states. [2018-02-04 14:58:56,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:56,341 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 14:58:56,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:58:56,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 14:58:56,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:56,342 INFO L225 Difference]: With dead ends: 77 [2018-02-04 14:58:56,342 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 14:58:56,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:58:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 14:58:56,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-02-04 14:58:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 14:58:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-02-04 14:58:56,345 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 23 [2018-02-04 14:58:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:56,346 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-02-04 14:58:56,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:58:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-02-04 14:58:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:58:56,346 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:56,346 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] [2018-02-04 14:58:56,346 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash 851058669, now seen corresponding path program 1 times [2018-02-04 14:58:56,347 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:56,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:56,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 14:58:56,465 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:56,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-04 14:58:56,465 INFO L182 omatonBuilderFactory]: Interpolants [790#true, 791#false, 792#(and (<= main_~length~0 1) (<= 1 main_~length~0)), 793#(and (<= main_~length~0 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 794#(and (= (+ main_~nondetString~0.offset main_~length~0) 1) (= main_~nondetString~0.offset 0)), 795#(and (= main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset))), 796#(= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|)), 797#(= 0 (select (select |#memory_int| cstrncpy_~src~0.base) cstrncpy_~src~0.offset)), 798#(= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) |cstrncpy_#t~post2.offset|)), 799#(= 0 |cstrncpy_#t~mem4|)] [2018-02-04 14:58:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:58:56,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:58:56,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:58:56,466 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 10 states. [2018-02-04 14:58:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:56,586 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-02-04 14:58:56,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 14:58:56,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 14:58:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:56,587 INFO L225 Difference]: With dead ends: 121 [2018-02-04 14:58:56,587 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 14:58:56,587 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-04 14:58:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 14:58:56,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2018-02-04 14:58:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 14:58:56,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-02-04 14:58:56,591 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 23 [2018-02-04 14:58:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:56,592 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-02-04 14:58:56,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:58:56,592 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-02-04 14:58:56,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 14:58:56,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:56,593 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] [2018-02-04 14:58:56,593 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:56,593 INFO L82 PathProgramCache]: Analyzing trace with hash -737289233, now seen corresponding path program 1 times [2018-02-04 14:58:56,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:56,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:56,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 14:58:56,747 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,748 INFO L182 omatonBuilderFactory]: Interpolants [1024#(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)), 1025#(and (or (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) |cstrncpy_#in~s2.offset|)) (<= 2 (select |#length| |cstrncpy_#in~s2.base|))) (= 0 |cstrncpy_#in~s2.offset|)), 1026#(and (= 0 cstrncpy_~src~0.offset) (or (<= 2 (select |#length| cstrncpy_~src~0.base)) (= 0 (select (select |#memory_int| cstrncpy_~src~0.base) cstrncpy_~src~0.offset)))), 1027#(and (= |cstrncpy_#t~post2.offset| 0) (or (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) |cstrncpy_#t~post2.offset|)) (and (<= (+ cstrncpy_~src~0.offset 1) (+ |cstrncpy_#t~post2.offset| (select |#length| |cstrncpy_#t~post2.base|))) (<= (+ |cstrncpy_#t~post2.offset| 1) cstrncpy_~src~0.offset) (= |cstrncpy_#t~post2.base| cstrncpy_~src~0.base)))), 1028#(or (= 0 |cstrncpy_#t~mem4|) (and (<= (+ cstrncpy_~src~0.offset 1) (select |#length| cstrncpy_~src~0.base)) (<= 1 cstrncpy_~src~0.offset))), 1029#(and (<= (+ cstrncpy_~src~0.offset 1) (select |#length| cstrncpy_~src~0.base)) (<= 1 cstrncpy_~src~0.offset)), 1030#(and (<= (+ |cstrncpy_#t~post2.offset| 1) (select |#length| |cstrncpy_#t~post2.base|)) (<= 1 |cstrncpy_#t~post2.offset|)), 1019#true, 1020#false, 1021#(<= 1 main_~length~0), 1022#(and (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 1023#(and (= 0 main_~nondetString~0.offset) (<= 1 main_~length~0))] [2018-02-04 14:58:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:58:56,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:58:56,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:56,749 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 12 states. [2018-02-04 14:58:56,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:56,890 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-02-04 14:58:56,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 14:58:56,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-02-04 14:58:56,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:56,891 INFO L225 Difference]: With dead ends: 115 [2018-02-04 14:58:56,891 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 14:58:56,891 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:58:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 14:58:56,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2018-02-04 14:58:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 14:58:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2018-02-04 14:58:56,895 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 23 [2018-02-04 14:58:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:56,896 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2018-02-04 14:58:56,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:58:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-02-04 14:58:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:58:56,896 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:56,896 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] [2018-02-04 14:58:56,897 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:56,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2111493848, now seen corresponding path program 1 times [2018-02-04 14:58:56,897 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:56,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:56,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:58:56,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,935 INFO L182 omatonBuilderFactory]: Interpolants [1248#true, 1249#false, 1250#(= |cstrncpy_#t~post1.base| cstrncpy_~dst~0.base), 1251#(= 1 (select |#valid| cstrncpy_~dst~0.base)), 1252#(= 1 (select |#valid| cstrncpy_~us~0.base)), 1253#(= 1 (select |#valid| |cstrncpy_#t~post6.base|))] [2018-02-04 14:58:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:56,935 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:58:56,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:58:56,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:56,935 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand 6 states. [2018-02-04 14:58:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:57,007 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-02-04 14:58:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:58:57,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 14:58:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:57,008 INFO L225 Difference]: With dead ends: 104 [2018-02-04 14:58:57,008 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 14:58:57,008 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:58:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 14:58:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-02-04 14:58:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 14:58:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2018-02-04 14:58:57,012 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 24 [2018-02-04 14:58:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:57,012 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-02-04 14:58:57,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:58:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2018-02-04 14:58:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:58:57,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:57,013 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] [2018-02-04 14:58:57,014 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:57,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2111493847, now seen corresponding path program 1 times [2018-02-04 14:58:57,014 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:57,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:57,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:57,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:58:57,069 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:57,069 INFO L182 omatonBuilderFactory]: Interpolants [1456#(and (<= 1 |cstrncpy_#in~n|) (<= |cstrncpy_#in~n| 1)), 1457#(and (<= cstrncpy_~n 1) (<= 1 cstrncpy_~n)), 1458#(and (<= 0 cstrncpy_~n) (<= cstrncpy_~n 0)), 1459#(and (<= cstrncpy_~n2~0 0) (<= 0 cstrncpy_~n2~0)), 1460#(and (<= |cstrncpy_#t~post5| 0) (<= 0 |cstrncpy_#t~post5|)), 1453#true, 1454#false, 1455#(and (<= 1 main_~n~0) (<= main_~n~0 1))] [2018-02-04 14:58:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:57,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:58:57,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:58:57,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:58:57,070 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 8 states. [2018-02-04 14:58:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:57,116 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-02-04 14:58:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:58:57,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-02-04 14:58:57,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:57,117 INFO L225 Difference]: With dead ends: 112 [2018-02-04 14:58:57,117 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 14:58:57,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:57,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 14:58:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-02-04 14:58:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 14:58:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-02-04 14:58:57,120 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2018-02-04 14:58:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:57,120 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-02-04 14:58:57,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:58:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-02-04 14:58:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:58:57,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:57,121 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] [2018-02-04 14:58:57,121 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash 595125547, now seen corresponding path program 1 times [2018-02-04 14:58:57,122 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:57,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:57,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:57,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 14:58:57,294 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:57,294 INFO L182 omatonBuilderFactory]: Interpolants [1696#(and (<= (+ cstrncpy_~dst~0.offset cstrncpy_~n) (select |#length| cstrncpy_~dst~0.base)) (<= 1 cstrncpy_~dst~0.offset) (<= 0 cstrncpy_~n)), 1697#(and (<= 1 cstrncpy_~us~0.offset) (<= (+ cstrncpy_~us~0.offset cstrncpy_~n2~0) (select |#length| cstrncpy_~us~0.base)) (<= 0 cstrncpy_~n2~0)), 1698#(and (<= 1 cstrncpy_~us~0.offset) (<= 0 |cstrncpy_#t~post5|) (or (<= |cstrncpy_#t~post5| 0) (<= (+ cstrncpy_~us~0.offset |cstrncpy_#t~post5|) (select |#length| cstrncpy_~us~0.base)))), 1699#(and (<= (+ |cstrncpy_#t~post6.offset| 1) (select |#length| |cstrncpy_#t~post6.base|)) (<= 1 |cstrncpy_#t~post6.offset|)), 1686#true, 1687#false, 1688#(and (<= main_~length~0 1) (<= 1 main_~length~0)), 1689#(and (<= main_~length~0 1) (= 0 |main_#t~malloc10.offset|) (= main_~n~0 (select |#length| |main_#t~malloc10.base|)) (<= 1 main_~length~0) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1690#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= main_~length~0 1) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset) (<= 1 main_~length~0)), 1691#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= main_~length~0 1) (= 0 main_~nondetArea~0.offset) (<= 1 main_~length~0)), 1692#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 1693#(and (<= (select |#length| |cstrncpy_#in~s1.base|) |cstrncpy_#in~n|) (<= |cstrncpy_#in~n| (select |#length| |cstrncpy_#in~s1.base|)) (= 0 |cstrncpy_#in~s1.offset|)), 1694#(and (= 0 cstrncpy_~dst~0.offset) (<= (select |#length| cstrncpy_~dst~0.base) cstrncpy_~n) (<= cstrncpy_~n (select |#length| cstrncpy_~dst~0.base))), 1695#(and (<= (+ cstrncpy_~dst~0.offset cstrncpy_~n) (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset|)) (= |cstrncpy_#t~post1.base| cstrncpy_~dst~0.base) (<= (+ |cstrncpy_#t~post1.offset| 1) cstrncpy_~dst~0.offset) (<= (select |#length| |cstrncpy_#t~post1.base|) (+ cstrncpy_~n 1)) (= |cstrncpy_#t~post1.offset| 0))] [2018-02-04 14:58:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:57,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 14:58:57,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 14:58:57,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-04 14:58:57,295 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 14 states. [2018-02-04 14:58:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:57,588 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-02-04 14:58:57,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 14:58:57,588 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-02-04 14:58:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:57,589 INFO L225 Difference]: With dead ends: 121 [2018-02-04 14:58:57,589 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 14:58:57,589 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:58:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 14:58:57,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-02-04 14:58:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 14:58:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-04 14:58:57,592 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 24 [2018-02-04 14:58:57,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:57,593 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-04 14:58:57,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 14:58:57,593 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-04 14:58:57,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:58:57,593 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:57,593 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] [2018-02-04 14:58:57,593 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:57,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1399019159, now seen corresponding path program 1 times [2018-02-04 14:58:57,594 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:57,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:57,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:57,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 14:58:57,727 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:57,727 INFO L182 omatonBuilderFactory]: Interpolants [1952#(and (<= (+ cstrncpy_~dst~0.offset cstrncpy_~n) (select |#length| cstrncpy_~dst~0.base)) (<= 1 cstrncpy_~dst~0.offset) (<= 0 cstrncpy_~n)), 1953#(and (<= 1 cstrncpy_~us~0.offset) (<= (+ cstrncpy_~us~0.offset cstrncpy_~n2~0) (select |#length| cstrncpy_~us~0.base)) (<= 0 cstrncpy_~n2~0)), 1954#(and (<= 1 cstrncpy_~us~0.offset) (<= 0 |cstrncpy_#t~post5|) (or (<= |cstrncpy_#t~post5| 0) (<= (+ cstrncpy_~us~0.offset |cstrncpy_#t~post5|) (select |#length| cstrncpy_~us~0.base)))), 1955#(and (<= (+ |cstrncpy_#t~post6.offset| 1) (select |#length| |cstrncpy_#t~post6.base|)) (<= 1 |cstrncpy_#t~post6.offset|)), 1944#true, 1945#false, 1946#(and (= 0 |main_#t~malloc10.offset|) (= main_~n~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1947#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 1948#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 1949#(and (<= (select |#length| |cstrncpy_#in~s1.base|) |cstrncpy_#in~n|) (<= |cstrncpy_#in~n| (select |#length| |cstrncpy_#in~s1.base|)) (= 0 |cstrncpy_#in~s1.offset|)), 1950#(and (= 0 cstrncpy_~dst~0.offset) (<= (select |#length| cstrncpy_~dst~0.base) cstrncpy_~n) (<= cstrncpy_~n (select |#length| cstrncpy_~dst~0.base))), 1951#(and (<= (+ cstrncpy_~dst~0.offset cstrncpy_~n) (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset|)) (= |cstrncpy_#t~post1.base| cstrncpy_~dst~0.base) (<= (+ |cstrncpy_#t~post1.offset| 1) cstrncpy_~dst~0.offset) (<= (select |#length| |cstrncpy_#t~post1.base|) (+ cstrncpy_~n 1)) (= |cstrncpy_#t~post1.offset| 0))] [2018-02-04 14:58:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:57,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 14:58:57,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 14:58:57,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:58:57,728 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 12 states. [2018-02-04 14:58:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:58,004 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2018-02-04 14:58:58,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 14:58:58,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-02-04 14:58:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:58,005 INFO L225 Difference]: With dead ends: 121 [2018-02-04 14:58:58,006 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 14:58:58,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-04 14:58:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 14:58:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2018-02-04 14:58:58,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 14:58:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-02-04 14:58:58,010 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 24 [2018-02-04 14:58:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:58,010 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-02-04 14:58:58,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 14:58:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-02-04 14:58:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 14:58:58,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:58,011 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] [2018-02-04 14:58:58,011 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:58,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1381129789, now seen corresponding path program 1 times [2018-02-04 14:58:58,011 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:58,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:58,122 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:58,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 14:58:58,123 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:58,123 INFO L182 omatonBuilderFactory]: Interpolants [2208#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 2209#(and (<= |cstrncpy_#in~n| (select |#length| |cstrncpy_#in~s1.base|)) (= 0 |cstrncpy_#in~s1.offset|)), 2210#(and (= 0 cstrncpy_~dst~0.offset) (<= cstrncpy_~n (select |#length| cstrncpy_~dst~0.base))), 2211#(and (<= (+ cstrncpy_~dst~0.offset cstrncpy_~n) (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset|)) (= |cstrncpy_#t~post1.base| cstrncpy_~dst~0.base) (<= (+ |cstrncpy_#t~post1.offset| 1) cstrncpy_~dst~0.offset) (= |cstrncpy_#t~post1.offset| 0)), 2212#(and (<= (+ cstrncpy_~dst~0.offset cstrncpy_~n) (select |#length| cstrncpy_~dst~0.base)) (<= 1 cstrncpy_~dst~0.offset)), 2213#(and (<= 1 |cstrncpy_#t~post1.offset|) (<= (+ |cstrncpy_#t~post1.offset| 1) (select |#length| |cstrncpy_#t~post1.base|))), 2204#true, 2205#false, 2206#(and (= 0 |main_#t~malloc10.offset|) (= main_~n~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2207#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset))] [2018-02-04 14:58:58,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:58,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 14:58:58,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 14:58:58,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:58:58,124 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 10 states. [2018-02-04 14:58:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:58,259 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-02-04 14:58:58,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:58:58,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-04 14:58:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:58,260 INFO L225 Difference]: With dead ends: 118 [2018-02-04 14:58:58,260 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 14:58:58,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:58:58,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 14:58:58,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-02-04 14:58:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 14:58:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-02-04 14:58:58,264 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 24 [2018-02-04 14:58:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:58,265 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-02-04 14:58:58,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 14:58:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-02-04 14:58:58,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 14:58:58,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:58,266 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] [2018-02-04 14:58:58,266 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2091617170, now seen corresponding path program 1 times [2018-02-04 14:58:58,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:58,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:58,341 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:58,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:58:58,341 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:58,341 INFO L182 omatonBuilderFactory]: Interpolants [2454#true, 2455#false, 2456#(<= 1 main_~n~0), 2457#(= cstrncpy_~n |cstrncpy_#in~n|), 2458#(<= |cstrncpy_#in~n| 0)] [2018-02-04 14:58:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:58,342 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 14:58:58,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 14:58:58,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:58:58,342 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 5 states. [2018-02-04 14:58:58,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:58,366 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-02-04 14:58:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:58:58,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 14:58:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:58,368 INFO L225 Difference]: With dead ends: 118 [2018-02-04 14:58:58,368 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 14:58:58,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 14:58:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 14:58:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 14:58:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-02-04 14:58:58,373 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 26 [2018-02-04 14:58:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:58,373 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-02-04 14:58:58,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 14:58:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-02-04 14:58:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 14:58:58,374 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:58,374 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] [2018-02-04 14:58:58,374 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:58,375 INFO L82 PathProgramCache]: Analyzing trace with hash -156851199, now seen corresponding path program 2 times [2018-02-04 14:58:58,375 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:58,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:58,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:58,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 14:58:58,716 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:58,717 INFO L182 omatonBuilderFactory]: Interpolants [2691#true, 2692#false, 2693#(= (select |#valid| |main_#t~malloc10.base|) 1), 2694#(= (select |#valid| main_~nondetArea~0.base) 1), 2695#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (not (= main_~nondetArea~0.base |main_#t~malloc11.base|))), 2696#(and (or (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= (+ main_~nondetString~0.offset main_~length~0) 2)) (= 0 main_~nondetString~0.offset) (or (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (not (= (+ main_~nondetString~0.offset main_~length~0) 2)))), 2697#(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)), 2698#(and (or (<= (select |#length| |cstrncpy_#in~s2.base|) 1) (and (not (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|)) (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) 1))) (<= 3 (select |#length| |cstrncpy_#in~s2.base|))) (= 0 |cstrncpy_#in~s2.offset|)), 2699#(and (= 0 cstrncpy_~src~0.offset) (or (and (not (= cstrncpy_~dst~0.base cstrncpy_~src~0.base)) (= 0 (select (select |#memory_int| cstrncpy_~src~0.base) 1))) (<= (select |#length| cstrncpy_~src~0.base) 1) (<= 3 (select |#length| cstrncpy_~src~0.base)))), 2700#(and (= |cstrncpy_#t~post2.offset| 0) (or (and (not (= |cstrncpy_#t~post2.base| |cstrncpy_#t~post1.base|)) (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) 1)) (<= (+ |cstrncpy_#t~post2.offset| 1) cstrncpy_~src~0.offset) (= |cstrncpy_#t~post2.base| cstrncpy_~src~0.base) (<= cstrncpy_~src~0.offset (+ |cstrncpy_#t~post2.offset| 1))) (and (<= (+ |cstrncpy_#t~post2.offset| 1) cstrncpy_~src~0.offset) (= |cstrncpy_#t~post2.base| cstrncpy_~src~0.base) (or (<= (+ cstrncpy_~src~0.offset 2) (+ |cstrncpy_#t~post2.offset| (select |#length| |cstrncpy_#t~post2.base|))) (<= (+ |cstrncpy_#t~post2.offset| (select |#length| |cstrncpy_#t~post2.base|)) cstrncpy_~src~0.offset))))), 2701#(or (and (= 0 (select (select (store |#memory_int| |cstrncpy_#t~post1.base| (store (select |#memory_int| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| |cstrncpy_#t~mem4|)) cstrncpy_~src~0.base) 1)) (<= 1 cstrncpy_~src~0.offset) (<= cstrncpy_~src~0.offset 1)) (and (or (<= (select |#length| cstrncpy_~src~0.base) cstrncpy_~src~0.offset) (<= (+ cstrncpy_~src~0.offset 2) (select |#length| cstrncpy_~src~0.base))) (<= 1 cstrncpy_~src~0.offset))), 2702#(or (and (or (<= (select |#length| cstrncpy_~src~0.base) cstrncpy_~src~0.offset) (<= (+ cstrncpy_~src~0.offset 2) (select |#length| cstrncpy_~src~0.base))) (<= 1 cstrncpy_~src~0.offset)) (and (<= 1 cstrncpy_~src~0.offset) (<= cstrncpy_~src~0.offset 1) (= 0 (select (select |#memory_int| cstrncpy_~src~0.base) 1)))), 2703#(or (and (<= 2 cstrncpy_~src~0.offset) (or (<= (+ cstrncpy_~src~0.offset 1) (select |#length| cstrncpy_~src~0.base)) (<= (select |#length| |cstrncpy_#t~post2.base|) |cstrncpy_#t~post2.offset|))) (and (= 1 |cstrncpy_#t~post2.offset|) (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) |cstrncpy_#t~post2.offset|)))), 2704#(or (and (<= 2 cstrncpy_~src~0.offset) (<= (+ cstrncpy_~src~0.offset 1) (select |#length| cstrncpy_~src~0.base))) (= 0 |cstrncpy_#t~mem4|)), 2705#(and (<= 2 cstrncpy_~src~0.offset) (<= (+ cstrncpy_~src~0.offset 1) (select |#length| cstrncpy_~src~0.base))), 2706#(and (<= 2 |cstrncpy_#t~post2.offset|) (<= (+ |cstrncpy_#t~post2.offset| 1) (select |#length| |cstrncpy_#t~post2.base|)))] [2018-02-04 14:58:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:58,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 14:58:58,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 14:58:58,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 14:58:58,717 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 16 states. [2018-02-04 14:58:59,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:59,118 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2018-02-04 14:58:59,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 14:58:59,118 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-02-04 14:58:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:59,119 INFO L225 Difference]: With dead ends: 135 [2018-02-04 14:58:59,119 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 14:58:59,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-02-04 14:58:59,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 14:58:59,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2018-02-04 14:58:59,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 14:58:59,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2018-02-04 14:58:59,121 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 28 [2018-02-04 14:58:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:59,121 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2018-02-04 14:58:59,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 14:58:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-02-04 14:58:59,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 14:58:59,122 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:59,122 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, 1, 1, 1, 1] [2018-02-04 14:58:59,122 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:59,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1429135806, now seen corresponding path program 1 times [2018-02-04 14:58:59,123 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:59,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:59,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:59,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:58:59,305 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 14:58:59,306 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:59,306 INFO L182 omatonBuilderFactory]: Interpolants [2976#false, 2977#(and (= 0 |main_#t~malloc10.offset|) (= main_~n~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2978#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 2979#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 2980#(and (<= (select |#length| |cstrncpy_#in~s1.base|) |cstrncpy_#in~n|) (<= |cstrncpy_#in~n| (select |#length| |cstrncpy_#in~s1.base|)) (= 0 |cstrncpy_#in~s1.offset|)), 2981#(and (= 0 cstrncpy_~dst~0.offset) (<= (select |#length| cstrncpy_~dst~0.base) cstrncpy_~n) (<= cstrncpy_~n (select |#length| cstrncpy_~dst~0.base))), 2982#(and (<= (+ cstrncpy_~dst~0.offset cstrncpy_~n) (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset|)) (= |cstrncpy_#t~post1.base| cstrncpy_~dst~0.base) (<= (+ |cstrncpy_#t~post1.offset| 1) cstrncpy_~dst~0.offset) (<= (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset|) (+ cstrncpy_~dst~0.offset cstrncpy_~n)) (= |cstrncpy_#t~post1.offset| 0)), 2983#(and (<= (select |#length| cstrncpy_~dst~0.base) (+ cstrncpy_~dst~0.offset cstrncpy_~n)) (<= (+ cstrncpy_~dst~0.offset cstrncpy_~n) (select |#length| cstrncpy_~dst~0.base)) (<= 1 cstrncpy_~dst~0.offset)), 2984#(and (<= 1 cstrncpy_~us~0.offset) (<= (+ cstrncpy_~us~0.offset cstrncpy_~n2~0) (select |#length| cstrncpy_~us~0.base)) (<= (select |#length| cstrncpy_~us~0.base) (+ cstrncpy_~us~0.offset cstrncpy_~n2~0))), 2985#(and (<= 1 cstrncpy_~us~0.offset) (<= (+ cstrncpy_~us~0.offset cstrncpy_~n2~0 1) (select |#length| cstrncpy_~us~0.base)) (<= (select |#length| cstrncpy_~us~0.base) (+ cstrncpy_~us~0.offset cstrncpy_~n2~0 1))), 2986#(and (<= 2 cstrncpy_~us~0.offset) (<= (select |#length| |cstrncpy_#t~post6.base|) (+ |cstrncpy_#t~post6.offset| cstrncpy_~n2~0 1)) (<= (+ cstrncpy_~us~0.offset cstrncpy_~n2~0) (select |#length| |cstrncpy_#t~post6.base|)) (= |cstrncpy_#t~post6.base| cstrncpy_~us~0.base)), 2987#(and (<= 2 cstrncpy_~us~0.offset) (<= (+ cstrncpy_~us~0.offset cstrncpy_~n2~0) (select |#length| cstrncpy_~us~0.base)) (<= 0 cstrncpy_~n2~0)), 2988#(and (<= 2 cstrncpy_~us~0.offset) (<= 0 |cstrncpy_#t~post5|) (or (<= |cstrncpy_#t~post5| 0) (<= (+ cstrncpy_~us~0.offset |cstrncpy_#t~post5|) (select |#length| cstrncpy_~us~0.base)))), 2989#(and (<= (+ |cstrncpy_#t~post6.offset| 1) (select |#length| |cstrncpy_#t~post6.base|)) (<= 2 |cstrncpy_#t~post6.offset|)), 2975#true] [2018-02-04 14:58:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:59,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 14:58:59,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 14:58:59,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:58:59,307 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 15 states. [2018-02-04 14:58:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:59,732 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2018-02-04 14:58:59,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 14:58:59,732 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-04 14:58:59,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:59,733 INFO L225 Difference]: With dead ends: 124 [2018-02-04 14:58:59,733 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 14:58:59,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-02-04 14:58:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 14:58:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2018-02-04 14:58:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 14:58:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-02-04 14:58:59,736 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 29 [2018-02-04 14:58:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:59,736 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-02-04 14:58:59,736 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 14:58:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-02-04 14:58:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 14:58:59,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:59,737 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:58:59,737 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:59,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1810852380, now seen corresponding path program 1 times [2018-02-04 14:58:59,738 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:59,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:58:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:58:59,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:58:59,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 14:58:59,798 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:58:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:58:59,798 INFO L182 omatonBuilderFactory]: Interpolants [3248#(and (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= |old(#valid)| (store (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0))), 3249#(= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0)), 3244#true, 3245#false, 3246#(= |#valid| |old(#valid)|), 3247#(and (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0)) (= (select |#valid| |main_#t~malloc10.base|) 1))] [2018-02-04 14:58:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:58:59,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 14:58:59,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 14:58:59,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 14:58:59,799 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 6 states. [2018-02-04 14:58:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:58:59,870 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-02-04 14:58:59,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:58:59,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 14:58:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:58:59,871 INFO L225 Difference]: With dead ends: 107 [2018-02-04 14:58:59,871 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 14:58:59,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:58:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 14:58:59,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-04 14:58:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 14:58:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-02-04 14:58:59,872 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-02-04 14:58:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:58:59,872 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-02-04 14:58:59,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 14:58:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-02-04 14:58:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 14:58:59,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:58:59,873 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] [2018-02-04 14:58:59,873 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 14:58:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash 453121839, now seen corresponding path program 3 times [2018-02-04 14:58:59,873 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:58:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:58:59,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:59:00,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:00,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 14:59:00,077 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:00,077 INFO L182 omatonBuilderFactory]: Interpolants [3395#true, 3396#false, 3397#(= (select |#valid| |main_#t~malloc10.base|) 1), 3398#(= (select |#valid| main_~nondetArea~0.base) 1), 3399#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (not (= main_~nondetArea~0.base |main_#t~malloc11.base|))), 3400#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= main_~nondetString~0.offset 0)), 3401#(and (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString~0.base) (+ (select |#length| main_~nondetString~0.base) (+ main_~nondetString~0.offset (- 1)))))), 3402#(and (= 0 (select (select |#memory_int| |cstrncpy_#in~s2.base|) (+ (select |#length| |cstrncpy_#in~s2.base|) (- 1)))) (not (= |cstrncpy_#in~s1.base| |cstrncpy_#in~s2.base|))), 3403#(and (not (= cstrncpy_~dst~0.base cstrncpy_~src~0.base)) (= 0 (select (select |#memory_int| cstrncpy_~src~0.base) (+ (select |#length| cstrncpy_~src~0.base) (- 1))))), 3404#(and (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) (+ (select |#length| |cstrncpy_#t~post2.base|) (- 1)))) (not (= cstrncpy_~src~0.base cstrncpy_~dst~0.base)) (not (= |cstrncpy_#t~post2.base| |cstrncpy_#t~post1.base|)) (= |cstrncpy_#t~post2.base| cstrncpy_~src~0.base)), 3405#(and (not (= cstrncpy_~src~0.base cstrncpy_~dst~0.base)) (= 0 (select (select (store |#memory_int| |cstrncpy_#t~post1.base| (store (select |#memory_int| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| |cstrncpy_#t~mem4|)) cstrncpy_~src~0.base) (+ (select |#length| cstrncpy_~src~0.base) (- 1))))), 3406#(and (not (= |cstrncpy_#t~post2.base| |cstrncpy_#t~post1.base|)) (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) (+ (select |#length| cstrncpy_~src~0.base) (- 1)))) (= |cstrncpy_#t~post2.base| cstrncpy_~src~0.base)), 3407#(= 0 (select (select (store |#memory_int| |cstrncpy_#t~post1.base| (store (select |#memory_int| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| |cstrncpy_#t~mem4|)) cstrncpy_~src~0.base) (+ (select |#length| cstrncpy_~src~0.base) (- 1)))), 3408#(= 0 (select (select |#memory_int| cstrncpy_~src~0.base) (+ (select |#length| cstrncpy_~src~0.base) (- 1)))), 3409#(and (or (<= (+ cstrncpy_~src~0.offset 1) (select |#length| cstrncpy_~src~0.base)) (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) |cstrncpy_#t~post2.offset|)) (<= (select |#length| |cstrncpy_#t~post2.base|) |cstrncpy_#t~post2.offset|)) (<= (+ |cstrncpy_#t~post2.offset| 1) cstrncpy_~src~0.offset)), 3410#(and (or (<= (+ cstrncpy_~src~0.offset 1) (select |#length| cstrncpy_~src~0.base)) (= 0 |cstrncpy_#t~mem4|)) (<= 1 cstrncpy_~src~0.offset)), 3411#(and (<= (+ cstrncpy_~src~0.offset 1) (select |#length| cstrncpy_~src~0.base)) (<= 1 cstrncpy_~src~0.offset)), 3412#(and (<= (+ |cstrncpy_#t~post2.offset| 1) (select |#length| |cstrncpy_#t~post2.base|)) (<= 1 |cstrncpy_#t~post2.offset|))] [2018-02-04 14:59:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 14:59:00,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 14:59:00,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 14:59:00,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-04 14:59:00,078 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2018-02-04 14:59:00,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:00,367 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-04 14:59:00,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 14:59:00,368 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-02-04 14:59:00,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:00,368 INFO L225 Difference]: With dead ends: 33 [2018-02-04 14:59:00,368 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:59:00,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2018-02-04 14:59:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:59:00,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:59:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:59:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:59:00,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-02-04 14:59:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:00,369 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:59:00,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 14:59:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:59:00,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:59:00,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:59:00 BoogieIcfgContainer [2018-02-04 14:59:00,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:59:00,373 INFO L168 Benchmark]: Toolchain (without parser) took 5917.28 ms. Allocated memory was 401.6 MB in the beginning and 715.7 MB in the end (delta: 314.0 MB). Free memory was 359.8 MB in the beginning and 593.0 MB in the end (delta: -233.2 MB). Peak memory consumption was 80.8 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:00,374 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:59:00,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.81 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 347.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:00,374 INFO L168 Benchmark]: Boogie Preprocessor took 24.46 ms. Allocated memory is still 401.6 MB. Free memory was 347.8 MB in the beginning and 346.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:00,375 INFO L168 Benchmark]: RCFGBuilder took 215.78 ms. Allocated memory is still 401.6 MB. Free memory was 346.5 MB in the beginning and 327.2 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:00,375 INFO L168 Benchmark]: TraceAbstraction took 5527.44 ms. Allocated memory was 401.6 MB in the beginning and 715.7 MB in the end (delta: 314.0 MB). Free memory was 327.2 MB in the beginning and 593.0 MB in the end (delta: -265.8 MB). Peak memory consumption was 48.2 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:00,376 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.21 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.81 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 347.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.46 ms. Allocated memory is still 401.6 MB. Free memory was 347.8 MB in the beginning and 346.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 215.78 ms. Allocated memory is still 401.6 MB. Free memory was 346.5 MB in the beginning and 327.2 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5527.44 ms. Allocated memory was 401.6 MB in the beginning and 715.7 MB in the end (delta: 314.0 MB). Free memory was 327.2 MB in the beginning and 593.0 MB in the end (delta: -265.8 MB). Peak memory consumption was 48.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: 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: 558]: 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 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 9 error locations. SAFE Result, 5.4s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 640 SDtfs, 766 SDslu, 2997 SDs, 0 SdLazy, 2232 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 255 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 10/54 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, 19 MinimizatonAttempts, 166 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 71987 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 10/54 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/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-59-00-382.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-59-00-382.csv Received shutdown request...