java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:50:15,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:50:15,089 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:50:15,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:50:15,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:50:15,101 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:50:15,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:50:15,103 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:50:15,104 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:50:15,105 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:50:15,105 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:50:15,106 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:50:15,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:50:15,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:50:15,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:50:15,110 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:50:15,111 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:50:15,113 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:50:15,114 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:50:15,115 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:50:15,116 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:50:15,117 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:50:15,117 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:50:15,118 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:50:15,118 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:50:15,119 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:50:15,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:50:15,120 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:50:15,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:50:15,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:50:15,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:50:15,121 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 09:50:15,131 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:50:15,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:50:15,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:50:15,132 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:50:15,133 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:50:15,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:50:15,133 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:50:15,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:50:15,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:50:15,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:50:15,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:50:15,134 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:50:15,134 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:50:15,134 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:50:15,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:50:15,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:50:15,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:50:15,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:50:15,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:50:15,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:50:15,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:50:15,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:50:15,135 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 09:50:15,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:50:15,178 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:50:15,184 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:50:15,185 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:50:15,186 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:50:15,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:50:15,308 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:50:15,309 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:50:15,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:50:15,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:50:15,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:50:15,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:50:15" (1/1) ... [2018-02-02 09:50:15,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad95545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15, skipping insertion in model container [2018-02-02 09:50:15,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:50:15" (1/1) ... [2018-02-02 09:50:15,327 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:50:15,353 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:50:15,445 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:50:15,462 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:50:15,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15 WrapperNode [2018-02-02 09:50:15,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:50:15,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:50:15,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:50:15,468 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:50:15,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15" (1/1) ... [2018-02-02 09:50:15,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15" (1/1) ... [2018-02-02 09:50:15,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15" (1/1) ... [2018-02-02 09:50:15,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15" (1/1) ... [2018-02-02 09:50:15,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15" (1/1) ... [2018-02-02 09:50:15,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15" (1/1) ... [2018-02-02 09:50:15,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15" (1/1) ... [2018-02-02 09:50:15,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:50:15,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:50:15,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:50:15,496 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:50:15,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:50:15,537 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:50:15,537 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:50:15,537 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-02-02 09:50:15,538 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:50:15,538 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:50:15,538 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:50:15,538 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:50:15,538 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:50:15,538 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:50:15,538 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:50:15,539 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-02-02 09:50:15,539 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:50:15,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:50:15,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:50:15,683 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:50:15,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:50:15 BoogieIcfgContainer [2018-02-02 09:50:15,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:50:15,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:50:15,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:50:15,686 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:50:15,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:50:15" (1/3) ... [2018-02-02 09:50:15,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325e6d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:50:15, skipping insertion in model container [2018-02-02 09:50:15,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:50:15" (2/3) ... [2018-02-02 09:50:15,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325e6d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:50:15, skipping insertion in model container [2018-02-02 09:50:15,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:50:15" (3/3) ... [2018-02-02 09:50:15,689 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-02 09:50:15,695 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:50:15,700 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 09:50:15,734 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:50:15,734 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:50:15,734 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 09:50:15,735 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 09:50:15,735 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:50:15,735 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:50:15,735 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:50:15,735 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:50:15,736 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:50:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-02-02 09:50:15,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:50:15,756 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:15,757 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:15,757 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:15,760 INFO L82 PathProgramCache]: Analyzing trace with hash -428881312, now seen corresponding path program 1 times [2018-02-02 09:50:15,794 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:15,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:15,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:15,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:50:15,890 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:15,890 INFO L182 omatonBuilderFactory]: Interpolants [51#true, 52#false, 53#(= 1 (select |#valid| |main_#t~malloc11.base|)), 54#(= 1 (select |#valid| main_~nondetString~0.base))] [2018-02-02 09:50:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:15,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:50:15,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:50:15,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:50:15,902 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-02-02 09:50:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:16,087 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-02 09:50:16,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:50:16,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 09:50:16,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:16,097 INFO L225 Difference]: With dead ends: 47 [2018-02-02 09:50:16,098 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 09:50:16,099 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 09:50:16,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 09:50:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 09:50:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-02 09:50:16,128 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-02-02 09:50:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:16,129 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-02 09:50:16,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:50:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-02 09:50:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 09:50:16,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:16,130 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:16,130 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash -428881311, now seen corresponding path program 1 times [2018-02-02 09:50:16,131 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:16,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:16,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:50:16,226 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,226 INFO L182 omatonBuilderFactory]: Interpolants [148#true, 149#false, 150#(<= 1 main_~length~0), 151#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 152#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0) (<= 1 main_~length~0))] [2018-02-02 09:50:16,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-02 09:50:16,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:50:16,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:50:16,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:16,229 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-02-02 09:50:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:16,271 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-02 09:50:16,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:50:16,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 09:50:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:16,273 INFO L225 Difference]: With dead ends: 43 [2018-02-02 09:50:16,273 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 09:50:16,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 09:50:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 09:50:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 09:50:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-02 09:50:16,278 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 13 [2018-02-02 09:50:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:16,278 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-02 09:50:16,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:50:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-02 09:50:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:50:16,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:16,279 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-02 09:50:16,279 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:16,280 INFO L82 PathProgramCache]: Analyzing trace with hash 551620863, now seen corresponding path program 1 times [2018-02-02 09:50:16,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:16,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:16,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:50:16,354 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,354 INFO L182 omatonBuilderFactory]: Interpolants [241#true, 242#false, 243#(= 1 (select |#valid| main_~nondetString~0.base)), 244#(= 1 (select |#valid| |cstrncpy_#in~src.base|)), 245#(= 1 (select |#valid| cstrncpy_~src.base)), 246#(= 1 (select |#valid| cstrncpy_~s~0.base)), 247#(= 1 (select |#valid| |cstrncpy_#t~post2.base|))] [2018-02-02 09:50:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:50:16,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:50:16,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:50:16,355 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-02-02 09:50:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:16,443 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-02-02 09:50:16,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:50:16,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-02 09:50:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:16,447 INFO L225 Difference]: With dead ends: 45 [2018-02-02 09:50:16,447 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 09:50:16,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 09:50:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-02-02 09:50:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 09:50:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-02 09:50:16,452 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 18 [2018-02-02 09:50:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:16,452 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-02 09:50:16,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:50:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-02 09:50:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:50:16,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:16,453 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-02 09:50:16,453 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash 551620864, now seen corresponding path program 1 times [2018-02-02 09:50:16,454 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:16,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:16,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-02 09:50:16,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:16,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:50:16,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,560 INFO L182 omatonBuilderFactory]: Interpolants [341#true, 342#false, 343#(<= 1 main_~length~0), 344#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 345#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset) (<= 1 main_~length~0)), 346#(and (<= 1 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset)), 347#(and (<= 1 (select |#length| |cstrncpy_#in~src.base|)) (= 0 |cstrncpy_#in~src.offset|)), 348#(and (= 0 cstrncpy_~src.offset) (<= 1 (select |#length| cstrncpy_~src.base))), 349#(and (= 0 cstrncpy_~s~0.offset) (<= 1 (select |#length| cstrncpy_~s~0.base))), 350#(and (= |cstrncpy_#t~post2.offset| 0) (<= 1 (select |#length| |cstrncpy_#t~post2.base|)))] [2018-02-02 09:50:16,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-02 09:50:16,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:50:16,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:50:16,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:16,561 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2018-02-02 09:50:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:16,667 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-02-02 09:50:16,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:50:16,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-02-02 09:50:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:16,668 INFO L225 Difference]: With dead ends: 48 [2018-02-02 09:50:16,669 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 09:50:16,669 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 09:50:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-02-02 09:50:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 09:50:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-02 09:50:16,671 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 18 [2018-02-02 09:50:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:16,671 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-02 09:50:16,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:50:16,672 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-02 09:50:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:50:16,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:16,672 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:16,672 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash -79622450, now seen corresponding path program 1 times [2018-02-02 09:50:16,673 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:16,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:16,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:50:16,778 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,779 INFO L182 omatonBuilderFactory]: Interpolants [451#true, 452#false, 453#(= 1 (select |#valid| |main_#t~malloc10.base|)), 454#(= 1 (select |#valid| main_~nondetArea~0.base)), 455#(or (= |main_#t~malloc11.base| main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 456#(or (= main_~nondetString~0.base main_~nondetArea~0.base) (= 1 (select |#valid| main_~nondetArea~0.base))), 457#(= 1 (select |#valid| |cstrncpy_#in~dst.base|)), 458#(= 1 (select |#valid| cstrncpy_~dst.base)), 459#(= 1 (select |#valid| cstrncpy_~d~0.base)), 460#(= 1 (select |#valid| |cstrncpy_#t~post1.base|))] [2018-02-02 09:50:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:50:16,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:50:16,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:16,780 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-02-02 09:50:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:16,886 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-02 09:50:16,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:50:16,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-02-02 09:50:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:16,887 INFO L225 Difference]: With dead ends: 46 [2018-02-02 09:50:16,887 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 09:50:16,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:16,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 09:50:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-02 09:50:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 09:50:16,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-02 09:50:16,891 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-02-02 09:50:16,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:16,891 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-02 09:50:16,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:50:16,891 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-02 09:50:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:50:16,892 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:16,892 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:16,892 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:16,892 INFO L82 PathProgramCache]: Analyzing trace with hash -79622449, now seen corresponding path program 1 times [2018-02-02 09:50:16,893 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:16,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:16,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:50:16,994 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,995 INFO L182 omatonBuilderFactory]: Interpolants [560#(<= 1 main_~n~0), 561#(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)), 562#(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)), 563#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 564#(and (= 0 |cstrncpy_#in~dst.offset|) (<= 1 (select |#length| |cstrncpy_#in~dst.base|))), 565#(and (<= 1 (select |#length| cstrncpy_~dst.base)) (= 0 cstrncpy_~dst.offset)), 566#(and (= 0 cstrncpy_~d~0.offset) (<= 1 (select |#length| cstrncpy_~d~0.base))), 567#(and (= |cstrncpy_#t~post1.offset| 0) (<= 1 (select |#length| |cstrncpy_#t~post1.base|))), 558#true, 559#false] [2018-02-02 09:50:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:16,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:50:16,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:50:16,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:16,995 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-02-02 09:50:17,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:17,121 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-02-02 09:50:17,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:50:17,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-02-02 09:50:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:17,122 INFO L225 Difference]: With dead ends: 45 [2018-02-02 09:50:17,122 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 09:50:17,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 09:50:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-02-02 09:50:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 09:50:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-02 09:50:17,125 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 19 [2018-02-02 09:50:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:17,126 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-02 09:50:17,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:50:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-02 09:50:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:50:17,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:17,127 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-02 09:50:17,127 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:17,127 INFO L82 PathProgramCache]: Analyzing trace with hash 670305991, now seen corresponding path program 1 times [2018-02-02 09:50:17,128 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:17,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:17,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:50:17,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,162 INFO L182 omatonBuilderFactory]: Interpolants [665#true, 666#false, 667#(= |cstrncpy_#t~post1.base| cstrncpy_~d~0.base), 668#(= 1 (select |#valid| cstrncpy_~d~0.base)), 669#(= 1 (select |#valid| |cstrncpy_#t~post6.base|))] [2018-02-02 09:50:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:50:17,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:50:17,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:50:17,162 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-02-02 09:50:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:17,193 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-02 09:50:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:50:17,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 09:50:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:17,194 INFO L225 Difference]: With dead ends: 46 [2018-02-02 09:50:17,194 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 09:50:17,194 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:50:17,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 09:50:17,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-02 09:50:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 09:50:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-02 09:50:17,196 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-02-02 09:50:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:17,196 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-02 09:50:17,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:50:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-02 09:50:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:50:17,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:17,197 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-02 09:50:17,197 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash 670305992, now seen corresponding path program 1 times [2018-02-02 09:50:17,198 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:17,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:17,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:50:17,331 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,331 INFO L182 omatonBuilderFactory]: Interpolants [768#(and (<= cstrncpy_~n 1) (<= 1 cstrncpy_~n)), 769#(<= |cstrncpy_#t~pre5| (* 4294967296 (div |cstrncpy_#t~pre5| 4294967296))), 763#true, 764#false, 765#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 766#(and (<= 1 |cstrncpy_#in~n|) (<= |cstrncpy_#in~n| 1)), 767#(and (< 0 (+ (div cstrncpy_~n 4294967296) 1)) (or (<= cstrncpy_~n 1) (<= cstrncpy_~n (* 4294967296 (div cstrncpy_~n 4294967296)))))] [2018-02-02 09:50:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:50:17,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:50:17,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:50:17,332 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-02-02 09:50:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:17,427 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-02-02 09:50:17,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:50:17,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 09:50:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:17,428 INFO L225 Difference]: With dead ends: 96 [2018-02-02 09:50:17,428 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 09:50:17,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 09:50:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2018-02-02 09:50:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 09:50:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-02-02 09:50:17,434 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 24 [2018-02-02 09:50:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:17,435 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-02-02 09:50:17,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:50:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-02-02 09:50:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:50:17,435 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:17,435 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] [2018-02-02 09:50:17,435 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:17,435 INFO L82 PathProgramCache]: Analyzing trace with hash 689332191, now seen corresponding path program 1 times [2018-02-02 09:50:17,436 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:17,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:17,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:50:17,537 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:17,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-02 09:50:17,538 INFO L182 omatonBuilderFactory]: Interpolants [944#true, 945#false, 946#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 947#(and (<= 1 |cstrncpy_#in~n|) (<= |cstrncpy_#in~n| 1)), 948#(and (< 0 (+ (div cstrncpy_~n 4294967296) 1)) (or (<= cstrncpy_~n 1) (<= cstrncpy_~n (* 4294967296 (div cstrncpy_~n 4294967296))))), 949#(and (<= cstrncpy_~n 1) (<= 1 cstrncpy_~n)), 950#(<= |cstrncpy_#t~pre0| (* 4294967296 (div |cstrncpy_#t~pre0| 4294967296)))] [2018-02-02 09:50:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:50:17,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:50:17,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:50:17,538 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 7 states. [2018-02-02 09:50:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:17,585 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-02-02 09:50:17,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:50:17,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 09:50:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:17,586 INFO L225 Difference]: With dead ends: 70 [2018-02-02 09:50:17,586 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 09:50:17,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:50:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 09:50:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-02-02 09:50:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 09:50:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-02-02 09:50:17,588 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 24 [2018-02-02 09:50:17,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:17,588 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-02-02 09:50:17,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:50:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-02-02 09:50:17,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:50:17,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:17,589 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-02 09:50:17,589 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:17,589 INFO L82 PathProgramCache]: Analyzing trace with hash -918041910, now seen corresponding path program 1 times [2018-02-02 09:50:17,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:17,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:17,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:50:17,758 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,759 INFO L182 omatonBuilderFactory]: Interpolants [1090#true, 1091#false, 1092#(<= 1 main_~n~0), 1093#(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)), 1094#(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)), 1095#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 1096#(and (<= 1 |cstrncpy_#in~n|) (= 0 |cstrncpy_#in~dst.offset|) (<= |cstrncpy_#in~n| (select |#length| |cstrncpy_#in~dst.base|))), 1097#(and (<= 1 cstrncpy_~n) (= 0 cstrncpy_~dst.offset) (<= cstrncpy_~n (select |#length| cstrncpy_~dst.base))), 1098#(and (= 0 cstrncpy_~d~0.offset) (<= cstrncpy_~n (select |#length| cstrncpy_~d~0.base)) (<= 1 cstrncpy_~n)), 1099#(and (<= 1 cstrncpy_~n) (<= (+ |cstrncpy_#t~post1.offset| 1) cstrncpy_~d~0.offset) (= |cstrncpy_#t~post1.base| cstrncpy_~d~0.base) (= |cstrncpy_#t~post1.offset| 0) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| 1))), 1100#(and (<= 1 cstrncpy_~n) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| cstrncpy_~d~0.base) 1)) (<= 1 cstrncpy_~d~0.offset)), 1101#(and (or (<= (+ |cstrncpy_#t~pre5| cstrncpy_~d~0.offset) (select |#length| cstrncpy_~d~0.base)) (<= |cstrncpy_#t~pre5| (* 4294967296 (div |cstrncpy_#t~pre5| 4294967296)))) (<= 1 cstrncpy_~d~0.offset) (< 0 (+ (div |cstrncpy_#t~pre5| 4294967296) 1))), 1102#(and (<= (+ |cstrncpy_#t~post6.offset| 1) (select |#length| |cstrncpy_#t~post6.base|)) (<= 1 |cstrncpy_#t~post6.offset|))] [2018-02-02 09:50:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:17,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:50:17,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:50:17,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:50:17,760 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 13 states. [2018-02-02 09:50:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:17,952 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-02-02 09:50:17,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:50:17,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-02 09:50:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:17,952 INFO L225 Difference]: With dead ends: 73 [2018-02-02 09:50:17,952 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 09:50:17,953 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:50:17,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 09:50:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-02-02 09:50:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 09:50:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-02-02 09:50:17,955 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2018-02-02 09:50:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:17,955 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-02-02 09:50:17,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:50:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-02-02 09:50:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:50:17,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:17,956 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] [2018-02-02 09:50:17,956 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:17,956 INFO L82 PathProgramCache]: Analyzing trace with hash -899015711, now seen corresponding path program 1 times [2018-02-02 09:50:17,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:17,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:18,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:18,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:50:18,092 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:18,093 INFO L182 omatonBuilderFactory]: Interpolants [1264#(= 0 (select (select |#memory_int| |cstrncpy_#in~src.base|) |cstrncpy_#in~src.offset|)), 1265#(= 0 (select (select |#memory_int| cstrncpy_~src.base) cstrncpy_~src.offset)), 1266#(= 0 (select (select |#memory_int| cstrncpy_~s~0.base) cstrncpy_~s~0.offset)), 1267#(= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) |cstrncpy_#t~post2.offset|)), 1268#(= 0 |cstrncpy_#t~mem4|), 1258#true, 1259#false, 1260#(and (<= main_~length~0 1) (<= 1 main_~length~0)), 1261#(and (<= main_~length~0 1) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 1262#(and (<= (+ main_~nondetString~0.offset main_~length~0) 1) (= main_~nondetString~0.offset 0) (<= 1 main_~length~0)), 1263#(and (= main_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset)))] [2018-02-02 09:50:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:18,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:50:18,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:50:18,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:50:18,094 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 11 states. [2018-02-02 09:50:18,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:18,231 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-02-02 09:50:18,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:50:18,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-02-02 09:50:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:18,234 INFO L225 Difference]: With dead ends: 119 [2018-02-02 09:50:18,234 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 09:50:18,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:50:18,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 09:50:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-02-02 09:50:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 09:50:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-02-02 09:50:18,241 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 24 [2018-02-02 09:50:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:18,242 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-02-02 09:50:18,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:50:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-02-02 09:50:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:50:18,243 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:18,243 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] [2018-02-02 09:50:18,243 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:18,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1401806879, now seen corresponding path program 1 times [2018-02-02 09:50:18,244 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:18,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:18,428 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:18,428 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 09:50:18,428 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:18,429 INFO L182 omatonBuilderFactory]: Interpolants [1513#true, 1514#false, 1515#(<= 1 main_~length~0), 1516#(and (= 0 |main_#t~malloc11.offset|) (<= 1 main_~length~0)), 1517#(and (= main_~nondetString~0.offset 0) (<= 1 main_~length~0)), 1518#(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)), 1519#(and (or (<= 2 (select |#length| |cstrncpy_#in~src.base|)) (= 0 (select (select |#memory_int| |cstrncpy_#in~src.base|) |cstrncpy_#in~src.offset|))) (= 0 |cstrncpy_#in~src.offset|)), 1520#(and (or (= 0 (select (select |#memory_int| cstrncpy_~src.base) cstrncpy_~src.offset)) (<= 2 (select |#length| cstrncpy_~src.base))) (= 0 cstrncpy_~src.offset)), 1521#(and (or (= 0 (select (select |#memory_int| cstrncpy_~s~0.base) cstrncpy_~s~0.offset)) (<= 2 (select |#length| cstrncpy_~s~0.base))) (= 0 cstrncpy_~s~0.offset)), 1522#(and (or (<= (+ cstrncpy_~s~0.offset 1) (+ |cstrncpy_#t~post2.offset| (select |#length| |cstrncpy_#t~post2.base|))) (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) |cstrncpy_#t~post2.offset|))) (<= (+ |cstrncpy_#t~post2.offset| 1) cstrncpy_~s~0.offset) (= |cstrncpy_#t~post2.offset| 0) (= |cstrncpy_#t~post2.base| cstrncpy_~s~0.base)), 1523#(and (<= 1 cstrncpy_~s~0.offset) (or (<= (+ cstrncpy_~s~0.offset 1) (select |#length| cstrncpy_~s~0.base)) (= 0 |cstrncpy_#t~mem4|))), 1524#(and (<= (+ cstrncpy_~s~0.offset 1) (select |#length| cstrncpy_~s~0.base)) (<= 1 cstrncpy_~s~0.offset)), 1525#(and (<= (+ |cstrncpy_#t~post2.offset| 1) (select |#length| |cstrncpy_#t~post2.base|)) (<= 1 |cstrncpy_#t~post2.offset|))] [2018-02-02 09:50:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:18,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:50:18,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:50:18,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:50:18,430 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 13 states. [2018-02-02 09:50:18,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:18,653 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2018-02-02 09:50:18,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:18,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-02 09:50:18,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:18,653 INFO L225 Difference]: With dead ends: 137 [2018-02-02 09:50:18,654 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 09:50:18,654 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:50:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 09:50:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-02-02 09:50:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 09:50:18,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-02-02 09:50:18,659 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 24 [2018-02-02 09:50:18,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:18,660 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-02-02 09:50:18,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:50:18,660 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-02-02 09:50:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 09:50:18,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:18,661 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] [2018-02-02 09:50:18,661 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1797191857, now seen corresponding path program 1 times [2018-02-02 09:50:18,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:18,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:18,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:50:18,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:50:18,726 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:18,726 INFO L182 omatonBuilderFactory]: Interpolants [1794#true, 1795#false, 1796#(= |#valid| |old(#valid)|), 1797#(and (= |old(#valid)| (store |#valid| |main_#t~malloc10.base| 0)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 1798#(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))), 1799#(= |old(#valid)| (store |#valid| |main_#t~malloc11.base| 0))] [2018-02-02 09:50:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:18,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:50:18,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:50:18,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:50:18,727 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 6 states. [2018-02-02 09:50:18,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:18,819 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2018-02-02 09:50:18,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:50:18,820 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 09:50:18,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:18,820 INFO L225 Difference]: With dead ends: 114 [2018-02-02 09:50:18,820 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 09:50:18,821 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:50:18,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 09:50:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-02-02 09:50:18,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 09:50:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-02 09:50:18,823 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 25 [2018-02-02 09:50:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:18,824 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-02 09:50:18,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:50:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-02 09:50:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 09:50:18,824 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:18,824 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:18,824 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:18,825 INFO L82 PathProgramCache]: Analyzing trace with hash 506340240, now seen corresponding path program 1 times [2018-02-02 09:50:18,825 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:18,836 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:19,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:19,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 09:50:19,017 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:19,017 INFO L182 omatonBuilderFactory]: Interpolants [1984#(and (or (<= |cstrncpy_#t~pre0| (* 4294967296 (div |cstrncpy_#t~pre0| 4294967296))) (<= (+ |cstrncpy_#t~pre0| cstrncpy_~d~0.offset) (select |#length| cstrncpy_~d~0.base))) (< 0 (+ (div |cstrncpy_#t~pre0| 4294967296) 1)) (<= 1 cstrncpy_~d~0.offset)), 1985#(and (<= 1 cstrncpy_~d~0.offset) (<= (+ cstrncpy_~d~0.offset 1) (select |#length| cstrncpy_~d~0.base))), 1986#(and (<= 1 |cstrncpy_#t~post1.offset|) (<= (+ |cstrncpy_#t~post1.offset| 1) (select |#length| |cstrncpy_#t~post1.base|))), 1973#true, 1974#false, 1975#(<= 1 main_~n~0), 1976#(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)), 1977#(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)), 1978#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 1979#(and (<= 1 |cstrncpy_#in~n|) (= 0 |cstrncpy_#in~dst.offset|) (<= |cstrncpy_#in~n| (select |#length| |cstrncpy_#in~dst.base|))), 1980#(and (<= 1 cstrncpy_~n) (= 0 cstrncpy_~dst.offset) (<= cstrncpy_~n (select |#length| cstrncpy_~dst.base))), 1981#(and (= 0 cstrncpy_~d~0.offset) (<= cstrncpy_~n (select |#length| cstrncpy_~d~0.base)) (<= 1 cstrncpy_~n)), 1982#(and (<= 1 cstrncpy_~n) (<= (+ |cstrncpy_#t~post1.offset| 1) cstrncpy_~d~0.offset) (= |cstrncpy_#t~post1.base| cstrncpy_~d~0.base) (= |cstrncpy_#t~post1.offset| 0) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| 1))), 1983#(and (<= 1 cstrncpy_~n) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| cstrncpy_~d~0.base) 1)) (<= 1 cstrncpy_~d~0.offset))] [2018-02-02 09:50:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:19,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 09:50:19,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 09:50:19,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:50:19,018 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 14 states. [2018-02-02 09:50:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:19,191 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-02-02 09:50:19,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:50:19,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-02-02 09:50:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:19,192 INFO L225 Difference]: With dead ends: 57 [2018-02-02 09:50:19,192 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 09:50:19,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:50:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 09:50:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-02-02 09:50:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 09:50:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 09:50:19,193 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-02-02 09:50:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:19,194 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 09:50:19,194 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 09:50:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 09:50:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 09:50:19,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:19,194 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-02 09:50:19,194 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:19,194 INFO L82 PathProgramCache]: Analyzing trace with hash -183633860, now seen corresponding path program 1 times [2018-02-02 09:50:19,195 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:19,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:19,401 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:19,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:50:19,402 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:19,402 INFO L182 omatonBuilderFactory]: Interpolants [2116#true, 2117#false, 2118#(and (= 0 |main_#t~malloc10.offset|) (= main_~n~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2119#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 2120#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 2121#(and (= 0 |cstrncpy_#in~dst.offset|) (<= |cstrncpy_#in~n| (select |#length| |cstrncpy_#in~dst.base|)) (<= (select |#length| |cstrncpy_#in~dst.base|) |cstrncpy_#in~n|)), 2122#(and (<= (select |#length| cstrncpy_~dst.base) cstrncpy_~n) (= 0 cstrncpy_~dst.offset) (<= cstrncpy_~n (select |#length| cstrncpy_~dst.base))), 2123#(and (= 0 cstrncpy_~d~0.offset) (<= (select |#length| cstrncpy_~d~0.base) cstrncpy_~n) (<= cstrncpy_~n (select |#length| cstrncpy_~d~0.base))), 2124#(and (<= (+ |cstrncpy_#t~post1.offset| 1) cstrncpy_~d~0.offset) (= |cstrncpy_#t~post1.base| cstrncpy_~d~0.base) (<= (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| 1) (+ cstrncpy_~n cstrncpy_~d~0.offset)) (= |cstrncpy_#t~post1.offset| 0) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| 1))), 2125#(and (<= (+ (select |#length| cstrncpy_~d~0.base) 1) (+ cstrncpy_~n cstrncpy_~d~0.offset)) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| cstrncpy_~d~0.base) 1)) (<= 1 cstrncpy_~d~0.offset)), 2126#(and (<= (select |#length| cstrncpy_~d~0.base) (+ cstrncpy_~n cstrncpy_~d~0.offset)) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (select |#length| cstrncpy_~d~0.base)) (<= 1 cstrncpy_~d~0.offset)), 2127#(and (<= (select |#length| |cstrncpy_#t~post6.base|) (+ cstrncpy_~n |cstrncpy_#t~post6.offset|)) (= |cstrncpy_#t~post6.base| cstrncpy_~d~0.base) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| |cstrncpy_#t~post6.base|) 1)) (<= 2 cstrncpy_~d~0.offset)), 2128#(and (<= 1 cstrncpy_~n) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| cstrncpy_~d~0.base) 1)) (<= 2 cstrncpy_~d~0.offset)), 2129#(and (or (<= (+ |cstrncpy_#t~pre5| cstrncpy_~d~0.offset) (select |#length| cstrncpy_~d~0.base)) (<= |cstrncpy_#t~pre5| (* 4294967296 (div |cstrncpy_#t~pre5| 4294967296)))) (< 0 (+ (div |cstrncpy_#t~pre5| 4294967296) 1)) (<= 2 cstrncpy_~d~0.offset)), 2130#(and (<= (+ |cstrncpy_#t~post6.offset| 1) (select |#length| |cstrncpy_#t~post6.base|)) (<= 2 |cstrncpy_#t~post6.offset|))] [2018-02-02 09:50:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:19,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:50:19,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:50:19,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:50:19,403 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 15 states. [2018-02-02 09:50:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:19,758 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-02-02 09:50:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:19,759 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-02 09:50:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:19,759 INFO L225 Difference]: With dead ends: 61 [2018-02-02 09:50:19,759 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 09:50:19,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:50:19,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 09:50:19,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 09:50:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 09:50:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-02 09:50:19,761 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 29 [2018-02-02 09:50:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:19,761 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-02 09:50:19,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:50:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-02 09:50:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:50:19,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:19,761 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, 1] [2018-02-02 09:50:19,761 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:19,762 INFO L82 PathProgramCache]: Analyzing trace with hash 996854439, now seen corresponding path program 1 times [2018-02-02 09:50:19,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:19,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:19,998 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:19,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 09:50:19,998 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:19,999 INFO L182 omatonBuilderFactory]: Interpolants [2254#true, 2255#false, 2256#(and (= 0 |main_#t~malloc10.offset|) (= main_~n~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2257#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 2258#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 2259#(and (= 0 |cstrncpy_#in~dst.offset|) (<= |cstrncpy_#in~n| (select |#length| |cstrncpy_#in~dst.base|)) (<= (select |#length| |cstrncpy_#in~dst.base|) |cstrncpy_#in~n|)), 2260#(and (<= (select |#length| cstrncpy_~dst.base) cstrncpy_~n) (= 0 cstrncpy_~dst.offset) (<= cstrncpy_~n (select |#length| cstrncpy_~dst.base))), 2261#(and (= 0 cstrncpy_~d~0.offset) (<= (select |#length| cstrncpy_~d~0.base) cstrncpy_~n) (<= cstrncpy_~n (select |#length| cstrncpy_~d~0.base))), 2262#(and (<= (+ |cstrncpy_#t~post1.offset| 1) cstrncpy_~d~0.offset) (= |cstrncpy_#t~post1.base| cstrncpy_~d~0.base) (<= (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| 1) (+ cstrncpy_~n cstrncpy_~d~0.offset)) (= |cstrncpy_#t~post1.offset| 0) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| 1))), 2263#(and (<= (+ (select |#length| cstrncpy_~d~0.base) 1) (+ cstrncpy_~n cstrncpy_~d~0.offset)) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| cstrncpy_~d~0.base) 1)) (<= 1 cstrncpy_~d~0.offset)), 2264#(and (<= (select |#length| cstrncpy_~d~0.base) (+ cstrncpy_~n cstrncpy_~d~0.offset)) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (select |#length| cstrncpy_~d~0.base)) (<= 1 cstrncpy_~d~0.offset)), 2265#(and (<= (select |#length| |cstrncpy_#t~post1.base|) (+ |cstrncpy_#t~post1.offset| cstrncpy_~n)) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| |cstrncpy_#t~post1.base|) 1)) (= |cstrncpy_#t~post1.base| cstrncpy_~d~0.base) (<= 2 cstrncpy_~d~0.offset)), 2266#(and (<= 1 cstrncpy_~n) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| cstrncpy_~d~0.base) 1)) (<= 2 cstrncpy_~d~0.offset)), 2267#(and (or (<= (+ |cstrncpy_#t~pre5| cstrncpy_~d~0.offset) (select |#length| cstrncpy_~d~0.base)) (<= |cstrncpy_#t~pre5| (* 4294967296 (div |cstrncpy_#t~pre5| 4294967296)))) (< 0 (+ (div |cstrncpy_#t~pre5| 4294967296) 1)) (<= 2 cstrncpy_~d~0.offset)), 2268#(and (<= (+ |cstrncpy_#t~post6.offset| 1) (select |#length| |cstrncpy_#t~post6.base|)) (<= 2 |cstrncpy_#t~post6.offset|))] [2018-02-02 09:50:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:19,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:50:20,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:50:20,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:50:20,000 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 15 states. [2018-02-02 09:50:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:20,352 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-02-02 09:50:20,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:50:20,353 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-02-02 09:50:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:20,353 INFO L225 Difference]: With dead ends: 37 [2018-02-02 09:50:20,353 INFO L226 Difference]: Without dead ends: 33 [2018-02-02 09:50:20,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2018-02-02 09:50:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-02 09:50:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-02 09:50:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 09:50:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-02-02 09:50:20,354 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-02-02 09:50:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:20,354 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-02-02 09:50:20,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:50:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-02-02 09:50:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:50:20,355 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:20,355 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:20,355 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:20,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1015880638, now seen corresponding path program 2 times [2018-02-02 09:50:20,355 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:20,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:20,679 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:20,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 09:50:20,679 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:20,679 INFO L182 omatonBuilderFactory]: Interpolants [2368#(and (or (and (= 0 (select (select |#memory_int| |cstrncpy_#in~src.base|) 1)) (not (= |cstrncpy_#in~dst.base| |cstrncpy_#in~src.base|))) (<= 3 (select |#length| |cstrncpy_#in~src.base|)) (<= (select |#length| |cstrncpy_#in~src.base|) 1)) (= 0 |cstrncpy_#in~src.offset|)), 2369#(and (= 0 cstrncpy_~src.offset) (or (and (not (= cstrncpy_~dst.base cstrncpy_~src.base)) (= 0 (select (select |#memory_int| cstrncpy_~src.base) 1))) (<= 3 (select |#length| cstrncpy_~src.base)) (<= (select |#length| cstrncpy_~src.base) 1))), 2370#(and (= 0 cstrncpy_~s~0.offset) (or (and (not (= cstrncpy_~d~0.base cstrncpy_~s~0.base)) (= 0 (select (select |#memory_int| cstrncpy_~s~0.base) 1))) (<= 3 (select |#length| cstrncpy_~s~0.base)) (<= (select |#length| cstrncpy_~s~0.base) 1))), 2371#(and (= |cstrncpy_#t~post2.offset| 0) (or (and (<= (+ |cstrncpy_#t~post2.offset| 1) cstrncpy_~s~0.offset) (= |cstrncpy_#t~post2.base| cstrncpy_~s~0.base) (or (<= (+ cstrncpy_~s~0.offset 2) (+ |cstrncpy_#t~post2.offset| (select |#length| |cstrncpy_#t~post2.base|))) (<= (+ |cstrncpy_#t~post2.offset| (select |#length| |cstrncpy_#t~post2.base|)) cstrncpy_~s~0.offset))) (and (<= (+ |cstrncpy_#t~post2.offset| 1) cstrncpy_~s~0.offset) (<= cstrncpy_~s~0.offset (+ |cstrncpy_#t~post2.offset| 1)) (not (= |cstrncpy_#t~post2.base| |cstrncpy_#t~post1.base|)) (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) 1)) (= |cstrncpy_#t~post2.base| cstrncpy_~s~0.base)))), 2372#(or (and (<= 1 cstrncpy_~s~0.offset) (= 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_~s~0.base) 1)) (<= cstrncpy_~s~0.offset 1)) (and (<= 1 cstrncpy_~s~0.offset) (or (<= (select |#length| cstrncpy_~s~0.base) cstrncpy_~s~0.offset) (<= (+ cstrncpy_~s~0.offset 2) (select |#length| cstrncpy_~s~0.base))))), 2373#(or (and (<= 1 cstrncpy_~s~0.offset) (or (<= (select |#length| cstrncpy_~s~0.base) cstrncpy_~s~0.offset) (<= (+ cstrncpy_~s~0.offset 2) (select |#length| cstrncpy_~s~0.base)))) (and (<= 1 cstrncpy_~s~0.offset) (<= cstrncpy_~s~0.offset 1) (= 0 (select (select |#memory_int| cstrncpy_~s~0.base) 1)))), 2374#(or (and (or (<= (+ cstrncpy_~s~0.offset 1) (select |#length| cstrncpy_~s~0.base)) (<= (select |#length| |cstrncpy_#t~post2.base|) |cstrncpy_#t~post2.offset|)) (<= 2 cstrncpy_~s~0.offset)) (and (= 1 |cstrncpy_#t~post2.offset|) (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) |cstrncpy_#t~post2.offset|)))), 2375#(or (= 0 |cstrncpy_#t~mem4|) (and (<= (+ cstrncpy_~s~0.offset 1) (select |#length| cstrncpy_~s~0.base)) (<= 2 cstrncpy_~s~0.offset))), 2376#(and (<= (+ cstrncpy_~s~0.offset 1) (select |#length| cstrncpy_~s~0.base)) (<= 2 cstrncpy_~s~0.offset)), 2377#(and (<= 2 |cstrncpy_#t~post2.offset|) (<= (+ |cstrncpy_#t~post2.offset| 1) (select |#length| |cstrncpy_#t~post2.base|))), 2361#true, 2362#false, 2363#(= (select |#valid| |main_#t~malloc10.base|) 1), 2364#(= (select |#valid| main_~nondetArea~0.base) 1), 2365#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (not (= main_~nondetArea~0.base |main_#t~malloc11.base|))), 2366#(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)))), 2367#(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))] [2018-02-02 09:50:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:20,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:50:20,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:50:20,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:50:20,680 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-02-02 09:50:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:20,995 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-02-02 09:50:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 09:50:20,996 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-02-02 09:50:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:20,996 INFO L225 Difference]: With dead ends: 41 [2018-02-02 09:50:20,996 INFO L226 Difference]: Without dead ends: 41 [2018-02-02 09:50:20,997 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-02-02 09:50:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-02 09:50:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-02-02 09:50:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 09:50:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-02 09:50:20,998 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 30 [2018-02-02 09:50:20,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:20,999 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-02 09:50:20,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:50:20,999 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-02 09:50:20,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 09:50:20,999 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:20,999 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:20,999 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:21,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1427528657, now seen corresponding path program 2 times [2018-02-02 09:50:21,000 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:21,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:21,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:21,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 09:50:21,391 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:21,391 INFO L182 omatonBuilderFactory]: Interpolants [2473#true, 2474#false, 2475#(and (= 0 |main_#t~malloc10.offset|) (= main_~n~0 (select |#length| |main_#t~malloc10.base|)) (= (select |#valid| |main_#t~malloc10.base|) 1)), 2476#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= (select |#valid| main_~nondetArea~0.base) 1) (= 0 main_~nondetArea~0.offset)), 2477#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 2478#(and (= 0 |cstrncpy_#in~dst.offset|) (<= |cstrncpy_#in~n| (select |#length| |cstrncpy_#in~dst.base|)) (<= (select |#length| |cstrncpy_#in~dst.base|) |cstrncpy_#in~n|)), 2479#(and (<= (select |#length| cstrncpy_~dst.base) cstrncpy_~n) (= 0 cstrncpy_~dst.offset) (<= cstrncpy_~n (select |#length| cstrncpy_~dst.base))), 2480#(and (= 0 cstrncpy_~d~0.offset) (<= (select |#length| cstrncpy_~d~0.base) cstrncpy_~n) (<= cstrncpy_~n (select |#length| cstrncpy_~d~0.base))), 2481#(and (<= (+ |cstrncpy_#t~post1.offset| 1) cstrncpy_~d~0.offset) (= |cstrncpy_#t~post1.base| cstrncpy_~d~0.base) (<= (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| 1) (+ cstrncpy_~n cstrncpy_~d~0.offset)) (= |cstrncpy_#t~post1.offset| 0) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| |cstrncpy_#t~post1.base|) |cstrncpy_#t~post1.offset| 1))), 2482#(and (<= (+ (select |#length| cstrncpy_~d~0.base) 1) (+ cstrncpy_~n cstrncpy_~d~0.offset)) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| cstrncpy_~d~0.base) 1)) (<= 1 cstrncpy_~d~0.offset)), 2483#(and (<= (select |#length| cstrncpy_~d~0.base) (+ cstrncpy_~n cstrncpy_~d~0.offset)) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (select |#length| cstrncpy_~d~0.base)) (<= 1 cstrncpy_~d~0.offset)), 2484#(and (<= (select |#length| |cstrncpy_#t~post1.base|) (+ |cstrncpy_#t~post1.offset| cstrncpy_~n)) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| |cstrncpy_#t~post1.base|) 1)) (= |cstrncpy_#t~post1.base| cstrncpy_~d~0.base) (<= 2 cstrncpy_~d~0.offset)), 2485#(and (<= 1 cstrncpy_~n) (<= (+ cstrncpy_~n cstrncpy_~d~0.offset) (+ (select |#length| cstrncpy_~d~0.base) 1)) (<= 2 cstrncpy_~d~0.offset)), 2486#(and (or (<= |cstrncpy_#t~pre0| (* 4294967296 (div |cstrncpy_#t~pre0| 4294967296))) (<= (+ |cstrncpy_#t~pre0| cstrncpy_~d~0.offset) (select |#length| cstrncpy_~d~0.base))) (< 0 (+ (div |cstrncpy_#t~pre0| 4294967296) 1)) (<= 2 cstrncpy_~d~0.offset)), 2487#(and (<= (+ cstrncpy_~d~0.offset 1) (select |#length| cstrncpy_~d~0.base)) (<= 2 cstrncpy_~d~0.offset)), 2488#(and (<= 2 |cstrncpy_#t~post1.offset|) (<= (+ |cstrncpy_#t~post1.offset| 1) (select |#length| |cstrncpy_#t~post1.base|)))] [2018-02-02 09:50:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:21,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:50:21,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:50:21,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:50:21,392 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 16 states. [2018-02-02 09:50:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:21,718 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-02-02 09:50:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:21,719 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-02-02 09:50:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:21,719 INFO L225 Difference]: With dead ends: 37 [2018-02-02 09:50:21,719 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 09:50:21,719 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-02-02 09:50:21,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 09:50:21,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-02 09:50:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 09:50:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-02-02 09:50:21,720 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-02-02 09:50:21,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:21,720 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-02-02 09:50:21,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:50:21,721 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-02-02 09:50:21,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 09:50:21,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:50:21,721 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:50:21,721 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 09:50:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash 351462429, now seen corresponding path program 3 times [2018-02-02 09:50:21,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 09:50:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:50:21,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:50:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 09:50:21,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:50:21,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 09:50:21,957 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 09:50:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:50:21,957 INFO L182 omatonBuilderFactory]: Interpolants [2592#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (not (= main_~nondetArea~0.base main_~nondetString~0.base)) (= main_~nondetString~0.offset 0)), 2593#(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)))))), 2594#(and (= 0 (select (select |#memory_int| |cstrncpy_#in~src.base|) (+ (select |#length| |cstrncpy_#in~src.base|) (- 1)))) (not (= |cstrncpy_#in~dst.base| |cstrncpy_#in~src.base|))), 2595#(and (not (= cstrncpy_~dst.base cstrncpy_~src.base)) (= 0 (select (select |#memory_int| cstrncpy_~src.base) (+ (select |#length| cstrncpy_~src.base) (- 1))))), 2596#(and (= 0 (select (select |#memory_int| cstrncpy_~s~0.base) (+ (select |#length| cstrncpy_~s~0.base) (- 1)))) (not (= cstrncpy_~d~0.base cstrncpy_~s~0.base))), 2597#(and (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) (+ (select |#length| |cstrncpy_#t~post2.base|) (- 1)))) (not (= |cstrncpy_#t~post2.base| |cstrncpy_#t~post1.base|)) (not (= cstrncpy_~d~0.base cstrncpy_~s~0.base)) (= |cstrncpy_#t~post2.base| cstrncpy_~s~0.base)), 2598#(and (not (= cstrncpy_~d~0.base cstrncpy_~s~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_~s~0.base) (+ (select |#length| cstrncpy_~s~0.base) (- 1))))), 2599#(and (= 0 (select (select |#memory_int| |cstrncpy_#t~post2.base|) (+ (select |#length| cstrncpy_~s~0.base) (- 1)))) (not (= |cstrncpy_#t~post2.base| |cstrncpy_#t~post1.base|)) (= |cstrncpy_#t~post2.base| cstrncpy_~s~0.base)), 2600#(= 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_~s~0.base) (+ (select |#length| cstrncpy_~s~0.base) (- 1)))), 2601#(= 0 (select (select |#memory_int| cstrncpy_~s~0.base) (+ (select |#length| cstrncpy_~s~0.base) (- 1)))), 2602#(and (<= (+ |cstrncpy_#t~post2.offset| 1) cstrncpy_~s~0.offset) (or (<= (+ cstrncpy_~s~0.offset 1) (select |#length| cstrncpy_~s~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|))), 2603#(and (<= 1 cstrncpy_~s~0.offset) (or (<= (+ cstrncpy_~s~0.offset 1) (select |#length| cstrncpy_~s~0.base)) (= 0 |cstrncpy_#t~mem4|))), 2604#(and (<= (+ cstrncpy_~s~0.offset 1) (select |#length| cstrncpy_~s~0.base)) (<= 1 cstrncpy_~s~0.offset)), 2605#(and (<= (+ |cstrncpy_#t~post2.offset| 1) (select |#length| |cstrncpy_#t~post2.base|)) (<= 1 |cstrncpy_#t~post2.offset|)), 2587#true, 2588#false, 2589#(= (select |#valid| |main_#t~malloc10.base|) 1), 2590#(= (select |#valid| main_~nondetArea~0.base) 1), 2591#(and (= main_~length~0 (select |#length| |main_#t~malloc11.base|)) (= 0 |main_#t~malloc11.offset|) (not (= main_~nondetArea~0.base |main_#t~malloc11.base|)))] [2018-02-02 09:50:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 09:50:21,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:50:21,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:50:21,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:50:21,958 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-02-02 09:50:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:50:22,231 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-02-02 09:50:22,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:50:22,231 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-02-02 09:50:22,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:50:22,231 INFO L225 Difference]: With dead ends: 36 [2018-02-02 09:50:22,231 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:50:22,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:50:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:50:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:50:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:50:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:50:22,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-02-02 09:50:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:50:22,232 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:50:22,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:50:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:50:22,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:50:22,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:50:22 BoogieIcfgContainer [2018-02-02 09:50:22,236 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:50:22,236 INFO L168 Benchmark]: Toolchain (without parser) took 6927.79 ms. Allocated memory was 404.8 MB in the beginning and 759.2 MB in the end (delta: 354.4 MB). Free memory was 363.0 MB in the beginning and 602.5 MB in the end (delta: -239.6 MB). Peak memory consumption was 114.8 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:22,237 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:50:22,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.18 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 351.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:22,237 INFO L168 Benchmark]: Boogie Preprocessor took 26.98 ms. Allocated memory is still 404.8 MB. Free memory was 351.0 MB in the beginning and 349.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:22,238 INFO L168 Benchmark]: RCFGBuilder took 188.50 ms. Allocated memory is still 404.8 MB. Free memory was 349.7 MB in the beginning and 330.3 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:22,238 INFO L168 Benchmark]: TraceAbstraction took 6551.57 ms. Allocated memory was 404.8 MB in the beginning and 759.2 MB in the end (delta: 354.4 MB). Free memory was 330.3 MB in the beginning and 602.5 MB in the end (delta: -272.2 MB). Peak memory consumption was 82.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:50:22,239 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.16 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.18 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 351.0 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.98 ms. Allocated memory is still 404.8 MB. Free memory was 351.0 MB in the beginning and 349.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 188.50 ms. Allocated memory is still 404.8 MB. Free memory was 349.7 MB in the beginning and 330.3 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6551.57 ms. Allocated memory was 404.8 MB in the beginning and 759.2 MB in the end (delta: 354.4 MB). Free memory was 330.3 MB in the beginning and 602.5 MB in the end (delta: -272.2 MB). Peak memory consumption was 82.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 48 locations, 9 error locations. SAFE Result, 6.5s OverallTime, 19 OverallIterations, 4 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 591 SDtfs, 850 SDslu, 2772 SDs, 0 SdLazy, 2494 SolverSat, 192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 5/63 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, 93 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 96502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 5/63 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/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-50-22-244.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-50-22-244.csv Received shutdown request...