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-ccafca9-m [2018-02-04 01:44:47,784 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:44:47,785 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:44:47,796 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:44:47,796 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:44:47,797 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:44:47,798 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:44:47,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:44:47,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:44:47,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:44:47,802 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:44:47,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:44:47,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:44:47,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:44:47,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:44:47,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:44:47,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:44:47,810 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:44:47,811 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:44:47,812 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:44:47,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:44:47,814 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:44:47,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:44:47,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:44:47,816 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:44:47,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:44:47,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:44:47,817 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:44:47,818 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:44:47,818 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:44:47,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:44:47,819 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 01:44:47,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:44:47,829 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:44:47,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:44:47,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:44:47,830 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:44:47,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:44:47,830 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:44:47,831 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:44:47,831 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:44:47,831 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:44:47,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:44:47,831 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:44:47,831 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:44:47,831 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:44:47,832 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:44:47,832 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:44:47,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:44:47,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:44:47,832 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:44:47,832 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:44:47,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:44:47,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:44:47,833 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:44:47,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:44:47,872 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:44:47,876 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:44:47,876 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:44:47,877 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:44:47,877 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 01:44:47,998 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:44:47,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:44:47,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:44:47,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:44:48,004 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:44:48,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:44:47" (1/1) ... [2018-02-04 01:44:48,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3ffa22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48, skipping insertion in model container [2018-02-04 01:44:48,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:44:47" (1/1) ... [2018-02-04 01:44:48,021 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:44:48,050 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:44:48,132 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:44:48,144 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:44:48,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48 WrapperNode [2018-02-04 01:44:48,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:44:48,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:44:48,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:44:48,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:44:48,161 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48" (1/1) ... [2018-02-04 01:44:48,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48" (1/1) ... [2018-02-04 01:44:48,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48" (1/1) ... [2018-02-04 01:44:48,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48" (1/1) ... [2018-02-04 01:44:48,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48" (1/1) ... [2018-02-04 01:44:48,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48" (1/1) ... [2018-02-04 01:44:48,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48" (1/1) ... [2018-02-04 01:44:48,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:44:48,179 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:44:48,179 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:44:48,180 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:44:48,180 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48" (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 01:44:48,221 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:44:48,221 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:44:48,222 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-02-04 01:44:48,222 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:44:48,222 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:44:48,222 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:44:48,222 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:44:48,222 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:44:48,222 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:44:48,222 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:44:48,222 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-02-04 01:44:48,222 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:44:48,222 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:44:48,222 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:44:48,375 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:44:48,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:44:48 BoogieIcfgContainer [2018-02-04 01:44:48,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:44:48,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:44:48,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:44:48,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:44:48,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:44:47" (1/3) ... [2018-02-04 01:44:48,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3feeeb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:44:48, skipping insertion in model container [2018-02-04 01:44:48,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:44:48" (2/3) ... [2018-02-04 01:44:48,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3feeeb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:44:48, skipping insertion in model container [2018-02-04 01:44:48,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:44:48" (3/3) ... [2018-02-04 01:44:48,380 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:44:48,385 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:44:48,389 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 01:44:48,414 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:44:48,415 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:44:48,415 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:44:48,415 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:44:48,415 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:44:48,415 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:44:48,415 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:44:48,415 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:44:48,416 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:44:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 01:44:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:44:48,430 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:48,431 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:44:48,431 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:48,434 INFO L82 PathProgramCache]: Analyzing trace with hash 118579097, now seen corresponding path program 1 times [2018-02-04 01:44:48,469 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:48,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:48,567 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 01:44:48,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:48,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:44:48,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:48,570 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 01:44:48,570 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 01:44:48,570 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 01:44:48,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:44:48,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:44:48,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:44:48,581 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-02-04 01:44:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:48,697 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-02-04 01:44:48,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 01:44:48,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 01:44:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:48,758 INFO L225 Difference]: With dead ends: 45 [2018-02-04 01:44:48,758 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 01:44:48,760 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 01:44:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 01:44:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 01:44:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 01:44:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 01:44:48,784 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-02-04 01:44:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:48,784 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 01:44:48,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:44:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 01:44:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 01:44:48,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:48,785 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:44:48,785 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:48,785 INFO L82 PathProgramCache]: Analyzing trace with hash 118579098, now seen corresponding path program 1 times [2018-02-04 01:44:48,786 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:48,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:48,925 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 01:44:48,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:48,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 01:44:48,926 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:48,927 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 01:44:48,927 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 01:44:48,927 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 01:44:48,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:44:48,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:44:48,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:44:48,930 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-02-04 01:44:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:48,973 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-02-04 01:44:48,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:44:48,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 01:44:48,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:48,974 INFO L225 Difference]: With dead ends: 41 [2018-02-04 01:44:48,974 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 01:44:48,975 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 01:44:48,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 01:44:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 01:44:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:44:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 01:44:48,979 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 13 [2018-02-04 01:44:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:48,980 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 01:44:48,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:44:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 01:44:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:44:48,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:48,981 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 01:44:48,981 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:48,981 INFO L82 PathProgramCache]: Analyzing trace with hash -539609344, now seen corresponding path program 1 times [2018-02-04 01:44:48,982 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:49,000 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:49,041 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 01:44:49,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:49,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:44:49,041 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:49,041 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 01:44:49,041 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 01:44:49,041 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 01:44:49,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:44:49,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:44:49,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:44:49,042 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2018-02-04 01:44:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:49,125 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-02-04 01:44:49,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:44:49,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 01:44:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:49,136 INFO L225 Difference]: With dead ends: 40 [2018-02-04 01:44:49,136 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 01:44:49,137 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 01:44:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 01:44:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-02-04 01:44:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 01:44:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-02-04 01:44:49,142 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2018-02-04 01:44:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:49,142 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-02-04 01:44:49,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:44:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-02-04 01:44:49,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:44:49,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:49,142 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 01:44:49,142 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:49,143 INFO L82 PathProgramCache]: Analyzing trace with hash -539609343, now seen corresponding path program 1 times [2018-02-04 01:44:49,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:49,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:49,254 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 01:44:49,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:49,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:44:49,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:49,255 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 01:44:49,255 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 01:44:49,255 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 01:44:49,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:44:49,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:44:49,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:44:49,256 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2018-02-04 01:44:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:49,343 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-02-04 01:44:49,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:44:49,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-04 01:44:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:49,345 INFO L225 Difference]: With dead ends: 50 [2018-02-04 01:44:49,345 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 01:44:49,346 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 01:44:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 01:44:49,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-02-04 01:44:49,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 01:44:49,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-04 01:44:49,349 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2018-02-04 01:44:49,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:49,349 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-04 01:44:49,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:44:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-04 01:44:49,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:44:49,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:49,349 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 01:44:49,349 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:49,350 INFO L82 PathProgramCache]: Analyzing trace with hash 451979505, now seen corresponding path program 1 times [2018-02-04 01:44:49,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:49,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:49,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 01:44:49,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:49,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:44:49,440 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:49,440 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 01:44:49,440 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 01:44:49,440 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 01:44:49,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:44:49,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:44:49,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:44:49,441 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 9 states. [2018-02-04 01:44:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:49,550 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-02-04 01:44:49,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:44:49,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 01:44:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:49,551 INFO L225 Difference]: With dead ends: 49 [2018-02-04 01:44:49,551 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 01:44:49,551 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:44:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 01:44:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-02-04 01:44:49,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 01:44:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-02-04 01:44:49,554 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 19 [2018-02-04 01:44:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:49,554 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-02-04 01:44:49,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:44:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-02-04 01:44:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:44:49,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:49,554 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 01:44:49,554 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash 451979504, now seen corresponding path program 1 times [2018-02-04 01:44:49,555 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:49,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:49,624 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 01:44:49,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:49,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:44:49,625 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:49,625 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 01:44:49,625 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 01:44:49,625 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 01:44:49,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:44:49,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:44:49,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:44:49,625 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 9 states. [2018-02-04 01:44:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:49,694 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-04 01:44:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:44:49,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-04 01:44:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:49,695 INFO L225 Difference]: With dead ends: 43 [2018-02-04 01:44:49,695 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 01:44:49,696 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 01:44:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 01:44:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 01:44:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 01:44:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-04 01:44:49,699 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-02-04 01:44:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:49,699 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-04 01:44:49,699 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:44:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-04 01:44:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:44:49,700 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:49,700 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 01:44:49,700 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:49,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1872127023, now seen corresponding path program 1 times [2018-02-04 01:44:49,701 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:49,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:49,754 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 01:44:49,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:49,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:44:49,754 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:49,755 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 01:44:49,755 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 01:44:49,755 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 01:44:49,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:44:49,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:44:49,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:44:49,755 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 6 states. [2018-02-04 01:44:49,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:49,814 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 01:44:49,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:44:49,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 01:44:49,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:49,816 INFO L225 Difference]: With dead ends: 77 [2018-02-04 01:44:49,816 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 01:44:49,816 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 01:44:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 01:44:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-02-04 01:44:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 01:44:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-02-04 01:44:49,821 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 23 [2018-02-04 01:44:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:49,821 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-02-04 01:44:49,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:44:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-02-04 01:44:49,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:44:49,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:49,822 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 01:44:49,822 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash 851058669, now seen corresponding path program 1 times [2018-02-04 01:44:49,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:49,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:49,914 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 01:44:49,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:49,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 01:44:49,915 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:49,915 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 01:44:49,915 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 01:44:49,915 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 01:44:49,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:44:49,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:44:49,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:44:49,916 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 10 states. [2018-02-04 01:44:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:50,045 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-02-04 01:44:50,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 01:44:50,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 01:44:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:50,047 INFO L225 Difference]: With dead ends: 121 [2018-02-04 01:44:50,047 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 01:44:50,050 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 01:44:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 01:44:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2018-02-04 01:44:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 01:44:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-02-04 01:44:50,059 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 23 [2018-02-04 01:44:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:50,059 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-02-04 01:44:50,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:44:50,060 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-02-04 01:44:50,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 01:44:50,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:50,060 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 01:44:50,060 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:50,061 INFO L82 PathProgramCache]: Analyzing trace with hash -737289233, now seen corresponding path program 1 times [2018-02-04 01:44:50,061 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:50,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:50,226 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 01:44:50,227 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:44:50,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 01:44:50,227 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:50,227 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 01:44:50,227 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 01:44:50,227 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 01:44:50,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:44:50,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:44:50,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:44:50,228 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 12 states. [2018-02-04 01:44:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:50,361 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-02-04 01:44:50,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:44:50,361 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-02-04 01:44:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:50,363 INFO L225 Difference]: With dead ends: 115 [2018-02-04 01:44:50,363 INFO L226 Difference]: Without dead ends: 115 [2018-02-04 01:44:50,363 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 01:44:50,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-04 01:44:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2018-02-04 01:44:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-04 01:44:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2018-02-04 01:44:50,370 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 23 [2018-02-04 01:44:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:50,370 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2018-02-04 01:44:50,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:44:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-02-04 01:44:50,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:44:50,371 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:50,371 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 01:44:50,371 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:50,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2111493848, now seen corresponding path program 1 times [2018-02-04 01:44:50,372 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:50,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:50,408 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 01:44:50,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:50,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:44:50,409 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:50,409 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 01:44:50,409 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 01:44:50,409 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 01:44:50,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:44:50,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:44:50,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:44:50,410 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand 6 states. [2018-02-04 01:44:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:50,480 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-02-04 01:44:50,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:44:50,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 01:44:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:50,481 INFO L225 Difference]: With dead ends: 104 [2018-02-04 01:44:50,481 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 01:44:50,481 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 01:44:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 01:44:50,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-02-04 01:44:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-04 01:44:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2018-02-04 01:44:50,486 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 24 [2018-02-04 01:44:50,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:50,486 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-02-04 01:44:50,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:44:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2018-02-04 01:44:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:44:50,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:50,487 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 01:44:50,487 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:50,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2111493847, now seen corresponding path program 1 times [2018-02-04 01:44:50,488 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:50,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:50,559 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 01:44:50,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:50,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 01:44:50,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:50,561 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 01:44:50,561 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 01:44:50,561 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 01:44:50,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:44:50,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:44:50,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:44:50,561 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 8 states. [2018-02-04 01:44:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:50,631 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-02-04 01:44:50,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:44:50,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-02-04 01:44:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:50,632 INFO L225 Difference]: With dead ends: 112 [2018-02-04 01:44:50,632 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 01:44:50,632 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 01:44:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 01:44:50,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-02-04 01:44:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-04 01:44:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-02-04 01:44:50,635 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2018-02-04 01:44:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:50,635 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-02-04 01:44:50,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:44:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-02-04 01:44:50,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:44:50,636 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:50,636 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 01:44:50,636 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:50,636 INFO L82 PathProgramCache]: Analyzing trace with hash 595125547, now seen corresponding path program 1 times [2018-02-04 01:44:50,637 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:50,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:50,848 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 01:44:50,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:50,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 01:44:50,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:50,849 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 01:44:50,849 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 01:44:50,849 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 01:44:50,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 01:44:50,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 01:44:50,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-04 01:44:50,850 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 14 states. [2018-02-04 01:44:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:51,091 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2018-02-04 01:44:51,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:44:51,091 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-02-04 01:44:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:51,092 INFO L225 Difference]: With dead ends: 121 [2018-02-04 01:44:51,092 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 01:44:51,092 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 01:44:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 01:44:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-02-04 01:44:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 01:44:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-04 01:44:51,095 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 24 [2018-02-04 01:44:51,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:51,095 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-04 01:44:51,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 01:44:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-04 01:44:51,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:44:51,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:51,096 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 01:44:51,096 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:51,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1399019159, now seen corresponding path program 1 times [2018-02-04 01:44:51,096 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:51,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:51,231 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 01:44:51,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:51,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 01:44:51,232 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:51,232 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 01:44:51,232 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 01:44:51,232 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 01:44:51,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:44:51,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:44:51,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:44:51,233 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 12 states. [2018-02-04 01:44:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:51,433 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2018-02-04 01:44:51,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:44:51,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-02-04 01:44:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:51,433 INFO L225 Difference]: With dead ends: 121 [2018-02-04 01:44:51,434 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 01:44:51,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:44:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 01:44:51,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2018-02-04 01:44:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 01:44:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-02-04 01:44:51,436 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 24 [2018-02-04 01:44:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:51,437 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-02-04 01:44:51,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:44:51,437 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-02-04 01:44:51,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 01:44:51,437 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:51,437 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 01:44:51,437 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:51,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1381129789, now seen corresponding path program 1 times [2018-02-04 01:44:51,438 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:51,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:51,536 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 01:44:51,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:44:51,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 01:44:51,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:51,537 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 01:44:51,537 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 01:44:51,537 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 01:44:51,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:44:51,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:44:51,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:44:51,538 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 10 states. [2018-02-04 01:44:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:51,683 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2018-02-04 01:44:51,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:44:51,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-04 01:44:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:51,684 INFO L225 Difference]: With dead ends: 118 [2018-02-04 01:44:51,684 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 01:44:51,684 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 01:44:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 01:44:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2018-02-04 01:44:51,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 01:44:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2018-02-04 01:44:51,687 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 24 [2018-02-04 01:44:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:51,687 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2018-02-04 01:44:51,688 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:44:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2018-02-04 01:44:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 01:44:51,688 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:51,689 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 01:44:51,689 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2091617170, now seen corresponding path program 1 times [2018-02-04 01:44:51,690 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:51,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:51,711 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 01:44:51,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:51,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:44:51,712 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:51,712 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 01:44:51,713 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 01:44:51,713 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 01:44:51,713 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:44:51,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:44:51,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:44:51,713 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 5 states. [2018-02-04 01:44:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:51,730 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2018-02-04 01:44:51,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:44:51,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 01:44:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:51,731 INFO L225 Difference]: With dead ends: 118 [2018-02-04 01:44:51,731 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 01:44:51,731 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 01:44:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 01:44:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-02-04 01:44:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-02-04 01:44:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2018-02-04 01:44:51,735 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 26 [2018-02-04 01:44:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:51,735 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2018-02-04 01:44:51,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:44:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2018-02-04 01:44:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:44:51,736 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:51,736 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 01:44:51,736 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash -156851199, now seen corresponding path program 2 times [2018-02-04 01:44:51,737 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:51,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:51,987 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 01:44:51,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:44:51,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-04 01:44:51,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:51,988 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 01:44:51,988 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 01:44:51,988 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 01:44:51,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 01:44:51,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 01:44:51,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:44:51,989 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand 16 states. [2018-02-04 01:44:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:52,362 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2018-02-04 01:44:52,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 01:44:52,363 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-02-04 01:44:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:52,363 INFO L225 Difference]: With dead ends: 135 [2018-02-04 01:44:52,364 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 01:44:52,364 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 01:44:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 01:44:52,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 117. [2018-02-04 01:44:52,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 01:44:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2018-02-04 01:44:52,368 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 28 [2018-02-04 01:44:52,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:52,368 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2018-02-04 01:44:52,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 01:44:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2018-02-04 01:44:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:44:52,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:52,369 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 01:44:52,369 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:52,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1429135806, now seen corresponding path program 1 times [2018-02-04 01:44:52,370 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:52,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:52,605 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 01:44:52,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:44:52,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 01:44:52,606 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:52,606 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 01:44:52,606 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 01:44:52,606 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 01:44:52,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 01:44:52,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 01:44:52,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:44:52,607 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 15 states. [2018-02-04 01:44:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:53,010 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2018-02-04 01:44:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 01:44:53,010 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-04 01:44:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:53,011 INFO L225 Difference]: With dead ends: 124 [2018-02-04 01:44:53,011 INFO L226 Difference]: Without dead ends: 124 [2018-02-04 01:44:53,011 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-02-04 01:44:53,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-04 01:44:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2018-02-04 01:44:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 01:44:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2018-02-04 01:44:53,013 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 29 [2018-02-04 01:44:53,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:53,013 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2018-02-04 01:44:53,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 01:44:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2018-02-04 01:44:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 01:44:53,014 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:53,014 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 01:44:53,014 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:53,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1810852380, now seen corresponding path program 1 times [2018-02-04 01:44:53,015 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:53,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:53,079 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 01:44:53,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:44:53,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:44:53,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:53,080 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 01:44:53,080 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 01:44:53,080 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 01:44:53,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:44:53,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:44:53,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:44:53,081 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 6 states. [2018-02-04 01:44:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:53,148 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-02-04 01:44:53,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:44:53,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 01:44:53,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:53,149 INFO L225 Difference]: With dead ends: 107 [2018-02-04 01:44:53,149 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 01:44:53,149 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 01:44:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 01:44:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-04 01:44:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 01:44:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-02-04 01:44:53,150 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-02-04 01:44:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:53,150 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-02-04 01:44:53,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:44:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-02-04 01:44:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 01:44:53,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:44:53,151 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 01:44:53,151 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 01:44:53,151 INFO L82 PathProgramCache]: Analyzing trace with hash 453121839, now seen corresponding path program 3 times [2018-02-04 01:44:53,151 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:44:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:44:53,158 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:44:53,360 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 01:44:53,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:44:53,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-02-04 01:44:53,361 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:44:53,361 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 01:44:53,361 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 01:44:53,361 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 01:44:53,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 01:44:53,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 01:44:53,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-02-04 01:44:53,361 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2018-02-04 01:44:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:44:53,630 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-04 01:44:53,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 01:44:53,630 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-02-04 01:44:53,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:44:53,631 INFO L225 Difference]: With dead ends: 33 [2018-02-04 01:44:53,631 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:44:53,631 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 01:44:53,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:44:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:44:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:44:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:44:53,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-02-04 01:44:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:44:53,632 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:44:53,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 01:44:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:44:53,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:44:53,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:44:53 BoogieIcfgContainer [2018-02-04 01:44:53,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:44:53,637 INFO L168 Benchmark]: Toolchain (without parser) took 5639.02 ms. Allocated memory was 394.3 MB in the beginning and 718.8 MB in the end (delta: 324.5 MB). Free memory was 352.3 MB in the beginning and 674.7 MB in the end (delta: -322.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-02-04 01:44:53,638 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:44:53,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.62 ms. Allocated memory is still 394.3 MB. Free memory was 350.9 MB in the beginning and 340.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:44:53,643 INFO L168 Benchmark]: Boogie Preprocessor took 30.91 ms. Allocated memory is still 394.3 MB. Free memory was 340.3 MB in the beginning and 339.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 01:44:53,643 INFO L168 Benchmark]: RCFGBuilder took 196.04 ms. Allocated memory is still 394.3 MB. Free memory was 339.0 MB in the beginning and 319.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 01:44:53,643 INFO L168 Benchmark]: TraceAbstraction took 5261.04 ms. Allocated memory was 394.3 MB in the beginning and 718.8 MB in the end (delta: 324.5 MB). Free memory was 319.1 MB in the beginning and 674.7 MB in the end (delta: -355.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:44:53,645 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 394.3 MB. Free memory is still 357.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.62 ms. Allocated memory is still 394.3 MB. Free memory was 350.9 MB in the beginning and 340.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.91 ms. Allocated memory is still 394.3 MB. Free memory was 340.3 MB in the beginning and 339.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 196.04 ms. Allocated memory is still 394.3 MB. Free memory was 339.0 MB in the beginning and 319.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5261.04 ms. Allocated memory was 394.3 MB in the beginning and 718.8 MB in the end (delta: 324.5 MB). Free memory was 319.1 MB in the beginning and 674.7 MB in the end (delta: -355.6 MB). There was no memory consumed. 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.2s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 2.7s 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.4s 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, 1.9s 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_01-44-53-651.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_01-44-53-651.csv Received shutdown request...