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_Camel.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 08:45:57,089 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:45:57,090 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:45:57,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:45:57,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:45:57,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:45:57,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:45:57,104 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:45:57,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:45:57,106 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:45:57,107 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:45:57,107 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:45:57,108 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:45:57,109 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:45:57,109 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:45:57,111 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:45:57,113 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:45:57,114 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:45:57,115 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:45:57,116 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:45:57,118 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:45:57,118 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:45:57,118 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:45:57,119 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:45:57,120 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:45:57,120 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:45:57,121 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:45:57,121 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:45:57,121 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:45:57,121 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:45:57,122 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:45:57,122 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:45:57,131 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:45:57,132 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:45:57,132 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:45:57,133 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:45:57,133 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:45:57,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:45:57,133 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:45:57,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:45:57,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:45:57,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:45:57,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:45:57,134 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:45:57,134 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:45:57,134 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:45:57,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:45:57,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:45:57,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:45:57,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:45:57,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:45:57,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:45:57,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:45:57,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:45:57,135 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:45:57,135 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:45:57,136 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:45:57,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:45:57,173 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:45:57,177 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:45:57,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:45:57,180 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:45:57,180 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 08:45:57,324 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:45:57,326 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:45:57,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:45:57,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:45:57,332 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:45:57,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:45:57" (1/1) ... [2018-02-02 08:45:57,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44e81c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57, skipping insertion in model container [2018-02-02 08:45:57,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:45:57" (1/1) ... [2018-02-02 08:45:57,348 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:45:57,378 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:45:57,469 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:45:57,482 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:45:57,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57 WrapperNode [2018-02-02 08:45:57,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:45:57,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:45:57,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:45:57,489 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:45:57,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57" (1/1) ... [2018-02-02 08:45:57,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57" (1/1) ... [2018-02-02 08:45:57,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57" (1/1) ... [2018-02-02 08:45:57,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57" (1/1) ... [2018-02-02 08:45:57,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57" (1/1) ... [2018-02-02 08:45:57,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57" (1/1) ... [2018-02-02 08:45:57,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57" (1/1) ... [2018-02-02 08:45:57,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:45:57,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:45:57,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:45:57,520 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:45:57,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57" (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 08:45:57,557 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:45:57,557 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:45:57,557 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-02-02 08:45:57,558 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:45:57,558 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:45:57,558 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:45:57,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:45:57,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:45:57,558 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:45:57,558 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:45:57,558 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-02-02 08:45:57,558 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:45:57,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:45:57,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:45:57,705 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:45:57,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:45:57 BoogieIcfgContainer [2018-02-02 08:45:57,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:45:57,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:45:57,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:45:57,707 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:45:57,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:45:57" (1/3) ... [2018-02-02 08:45:57,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb62f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:45:57, skipping insertion in model container [2018-02-02 08:45:57,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:57" (2/3) ... [2018-02-02 08:45:57,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb62f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:45:57, skipping insertion in model container [2018-02-02 08:45:57,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:45:57" (3/3) ... [2018-02-02 08:45:57,710 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:45:57,715 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:45:57,720 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 08:45:57,751 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:45:57,751 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:45:57,751 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:45:57,751 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:45:57,751 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:45:57,751 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:45:57,751 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:45:57,752 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:45:57,752 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:45:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-02-02 08:45:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:45:57,772 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:57,773 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:57,773 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:45:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash -428881312, now seen corresponding path program 1 times [2018-02-02 08:45:57,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:57,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:57,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:57,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:57,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:57,879 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:57,958 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 08:45:57,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:57,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:45:57,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:45:57,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:45:57,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:45:57,971 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-02-02 08:45:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:58,039 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-02 08:45:58,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:45:58,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 08:45:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:58,093 INFO L225 Difference]: With dead ends: 47 [2018-02-02 08:45:58,093 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 08:45:58,095 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 08:45:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 08:45:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 08:45:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 08:45:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-02 08:45:58,117 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-02-02 08:45:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:58,117 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-02 08:45:58,117 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:45:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-02 08:45:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:45:58,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:58,118 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:58,118 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:45:58,118 INFO L82 PathProgramCache]: Analyzing trace with hash -428881311, now seen corresponding path program 1 times [2018-02-02 08:45:58,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:58,119 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:58,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:58,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:58,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:58,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:58,236 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 08:45:58,236 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:58,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:45:58,238 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:45:58,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:45:58,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:45:58,239 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-02-02 08:45:58,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:58,299 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-02 08:45:58,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:45:58,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 08:45:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:58,300 INFO L225 Difference]: With dead ends: 43 [2018-02-02 08:45:58,300 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 08:45:58,301 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 08:45:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 08:45:58,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 08:45:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 08:45:58,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-02 08:45:58,305 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 13 [2018-02-02 08:45:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:58,305 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-02 08:45:58,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:45:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-02 08:45:58,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 08:45:58,306 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:58,306 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 08:45:58,306 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:45:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash 551620863, now seen corresponding path program 1 times [2018-02-02 08:45:58,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:58,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:58,307 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:58,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:58,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:58,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:58,374 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 08:45:58,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:58,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:45:58,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:45:58,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:45:58,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:45:58,376 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-02-02 08:45:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:58,495 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-02-02 08:45:58,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:45:58,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-02 08:45:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:58,499 INFO L225 Difference]: With dead ends: 45 [2018-02-02 08:45:58,500 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 08:45:58,500 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 08:45:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 08:45:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-02-02 08:45:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 08:45:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-02 08:45:58,505 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 18 [2018-02-02 08:45:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:58,506 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-02 08:45:58,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:45:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-02 08:45:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 08:45:58,507 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:58,507 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 08:45:58,507 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:45:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash 551620864, now seen corresponding path program 1 times [2018-02-02 08:45:58,507 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:58,507 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:58,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:58,509 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:58,509 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:58,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:58,637 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 08:45:58,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:58,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 08:45:58,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:45:58,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:45:58,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:45:58,639 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2018-02-02 08:45:58,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:58,751 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-02-02 08:45:58,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:45:58,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-02-02 08:45:58,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:58,752 INFO L225 Difference]: With dead ends: 48 [2018-02-02 08:45:58,752 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 08:45:58,752 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-02 08:45:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 08:45:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-02-02 08:45:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 08:45:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-02 08:45:58,756 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 18 [2018-02-02 08:45:58,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:58,757 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-02 08:45:58,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:45:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-02 08:45:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 08:45:58,757 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:58,758 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 08:45:58,758 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:45:58,758 INFO L82 PathProgramCache]: Analyzing trace with hash -79622450, now seen corresponding path program 1 times [2018-02-02 08:45:58,758 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:58,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:58,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:58,759 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:58,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:58,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:58,865 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 08:45:58,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:58,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 08:45:58,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:45:58,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:45:58,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:45:58,866 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-02-02 08:45:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:58,990 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-02 08:45:58,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:45:58,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-02-02 08:45:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:58,991 INFO L225 Difference]: With dead ends: 46 [2018-02-02 08:45:58,991 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 08:45:58,992 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 08:45:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 08:45:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-02 08:45:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 08:45:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-02 08:45:58,994 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-02-02 08:45:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:58,994 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-02 08:45:58,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:45:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-02 08:45:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 08:45:58,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:58,994 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 08:45:58,995 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:45:58,995 INFO L82 PathProgramCache]: Analyzing trace with hash -79622449, now seen corresponding path program 1 times [2018-02-02 08:45:58,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:58,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:58,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:58,996 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:58,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:59,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:59,088 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 08:45:59,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:59,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 08:45:59,089 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:45:59,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:45:59,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:45:59,089 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-02-02 08:45:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:59,209 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-02-02 08:45:59,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:45:59,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-02-02 08:45:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:59,210 INFO L225 Difference]: With dead ends: 45 [2018-02-02 08:45:59,210 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 08:45:59,210 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 08:45:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 08:45:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-02-02 08:45:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 08:45:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-02 08:45:59,212 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 19 [2018-02-02 08:45:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:59,212 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-02 08:45:59,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:45:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-02 08:45:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:45:59,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:59,213 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 08:45:59,213 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:45:59,213 INFO L82 PathProgramCache]: Analyzing trace with hash 670305991, now seen corresponding path program 1 times [2018-02-02 08:45:59,214 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:59,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:59,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:59,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:59,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:59,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:59,256 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 08:45:59,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:59,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:45:59,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:45:59,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:45:59,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:45:59,257 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-02-02 08:45:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:59,314 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-02 08:45:59,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:45:59,314 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-02 08:45:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:59,315 INFO L225 Difference]: With dead ends: 46 [2018-02-02 08:45:59,315 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 08:45:59,315 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 08:45:59,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 08:45:59,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-02 08:45:59,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 08:45:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-02 08:45:59,318 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-02-02 08:45:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:59,318 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-02 08:45:59,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:45:59,318 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-02 08:45:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:45:59,319 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:59,319 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 08:45:59,319 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:45:59,319 INFO L82 PathProgramCache]: Analyzing trace with hash 670305992, now seen corresponding path program 1 times [2018-02-02 08:45:59,319 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:59,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:59,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:59,320 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:59,320 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:59,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:59,450 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 08:45:59,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:59,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:45:59,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:45:59,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:45:59,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:45:59,451 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-02-02 08:45:59,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:59,548 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-02-02 08:45:59,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:45:59,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 08:45:59,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:59,550 INFO L225 Difference]: With dead ends: 96 [2018-02-02 08:45:59,550 INFO L226 Difference]: Without dead ends: 96 [2018-02-02 08:45:59,550 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 08:45:59,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-02 08:45:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2018-02-02 08:45:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-02 08:45:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-02-02 08:45:59,554 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 24 [2018-02-02 08:45:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:59,555 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-02-02 08:45:59,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:45:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-02-02 08:45:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:45:59,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:59,556 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 08:45:59,556 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:45:59,556 INFO L82 PathProgramCache]: Analyzing trace with hash 689332191, now seen corresponding path program 1 times [2018-02-02 08:45:59,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:59,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:59,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:59,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:59,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:59,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:59,670 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 08:45:59,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:59,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:45:59,670 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:45:59,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:45:59,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:45:59,671 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 7 states. [2018-02-02 08:45:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:59,711 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-02-02 08:45:59,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:45:59,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-02 08:45:59,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:59,712 INFO L225 Difference]: With dead ends: 70 [2018-02-02 08:45:59,712 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 08:45:59,712 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 08:45:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 08:45:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-02-02 08:45:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 08:45:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-02-02 08:45:59,714 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 24 [2018-02-02 08:45:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:59,715 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-02-02 08:45:59,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:45:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-02-02 08:45:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:45:59,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:59,715 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 08:45:59,715 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:45:59,715 INFO L82 PathProgramCache]: Analyzing trace with hash -918041910, now seen corresponding path program 1 times [2018-02-02 08:45:59,715 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:59,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:59,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:59,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:59,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:59,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:59,873 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 08:45:59,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:59,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 08:45:59,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:45:59,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:45:59,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:45:59,874 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 13 states. [2018-02-02 08:46:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:00,037 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-02-02 08:46:00,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:46:00,041 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-02 08:46:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:00,042 INFO L225 Difference]: With dead ends: 73 [2018-02-02 08:46:00,042 INFO L226 Difference]: Without dead ends: 73 [2018-02-02 08:46:00,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-02-02 08:46:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-02 08:46:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-02-02 08:46:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-02 08:46:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-02-02 08:46:00,045 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2018-02-02 08:46:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:00,045 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-02-02 08:46:00,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:46:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-02-02 08:46:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:46:00,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:00,046 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 08:46:00,046 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:46:00,046 INFO L82 PathProgramCache]: Analyzing trace with hash -899015711, now seen corresponding path program 1 times [2018-02-02 08:46:00,046 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:00,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:00,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:00,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:00,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:00,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:00,155 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 08:46:00,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:00,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 08:46:00,156 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:46:00,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:46:00,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:46:00,156 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 11 states. [2018-02-02 08:46:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:00,297 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-02-02 08:46:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:46:00,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-02-02 08:46:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:00,300 INFO L225 Difference]: With dead ends: 119 [2018-02-02 08:46:00,300 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 08:46:00,301 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 08:46:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 08:46:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-02-02 08:46:00,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-02 08:46:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-02-02 08:46:00,308 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 24 [2018-02-02 08:46:00,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:00,309 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-02-02 08:46:00,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:46:00,309 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-02-02 08:46:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:46:00,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:00,310 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 08:46:00,310 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:46:00,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1401806879, now seen corresponding path program 1 times [2018-02-02 08:46:00,310 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:00,310 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:00,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:00,311 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:00,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:00,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:00,474 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 08:46:00,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:00,475 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:46:00,492 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:00,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:00,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-02 08:46:00,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 08:46:00,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:00,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:00,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:46:00,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-02 08:46:00,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-02 08:46:00,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 08:46:00,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:46:00,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:00,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:00,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-02 08:46:00,810 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 08:46:00,838 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:00,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-02-02 08:46:00,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 08:46:00,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 08:46:00,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-02 08:46:00,839 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 19 states. [2018-02-02 08:46:03,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:03,494 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2018-02-02 08:46:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 08:46:03,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-02-02 08:46:03,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:03,495 INFO L225 Difference]: With dead ends: 137 [2018-02-02 08:46:03,496 INFO L226 Difference]: Without dead ends: 137 [2018-02-02 08:46:03,496 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2018-02-02 08:46:03,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-02 08:46:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-02-02 08:46:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 08:46:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-02-02 08:46:03,503 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 24 [2018-02-02 08:46:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:03,503 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-02-02 08:46:03,504 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 08:46:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-02-02 08:46:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:46:03,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:03,505 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 08:46:03,505 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:46:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1797191857, now seen corresponding path program 1 times [2018-02-02 08:46:03,505 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:03,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:03,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:03,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:03,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:03,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:46:03,647 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:46:03,647 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:46:03,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:46:03,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:46:03,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:46:03,648 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 6 states. [2018-02-02 08:46:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:03,759 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2018-02-02 08:46:03,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:46:03,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 08:46:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:03,760 INFO L225 Difference]: With dead ends: 114 [2018-02-02 08:46:03,760 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 08:46:03,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:46:03,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 08:46:03,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-02-02 08:46:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 08:46:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-02 08:46:03,763 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 25 [2018-02-02 08:46:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:03,763 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-02 08:46:03,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:46:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-02 08:46:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:46:03,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:03,764 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 08:46:03,764 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:46:03,764 INFO L82 PathProgramCache]: Analyzing trace with hash 506340240, now seen corresponding path program 1 times [2018-02-02 08:46:03,765 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:03,765 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:03,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:03,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:03,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:03,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:03,913 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 08:46:03,913 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:03,914 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:46:03,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:03,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:03,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:46:03,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:03,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:46:03,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:03,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:03,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:46:04,026 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:04,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:04,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:46:04,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:04,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 08:46:04,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:04,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:04,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:46:04,241 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 08:46:04,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:04,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-02-02 08:46:04,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:46:04,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:46:04,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:46:04,271 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 26 states. [2018-02-02 08:46:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:04,707 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-02-02 08:46:04,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:46:04,707 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-02-02 08:46:04,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:04,707 INFO L225 Difference]: With dead ends: 57 [2018-02-02 08:46:04,707 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 08:46:04,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 08:46:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 08:46:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-02-02 08:46:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 08:46:04,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-02 08:46:04,710 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-02-02 08:46:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:04,710 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-02 08:46:04,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 08:46:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-02 08:46:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 08:46:04,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:04,711 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 08:46:04,711 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:46:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash -183633860, now seen corresponding path program 1 times [2018-02-02 08:46:04,711 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:04,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:04,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:04,712 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:04,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:04,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:04,937 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 08:46:04,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:04,938 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:46:04,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:04,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:04,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:46:04,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:04,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:46:04,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:04,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:04,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:46:04,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:04,992 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:04,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:46:04,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:04,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 08:46:04,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:05,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:05,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:46:05,168 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 08:46:05,186 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:05,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-02-02 08:46:05,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 08:46:05,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 08:46:05,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:46:05,187 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 23 states. [2018-02-02 08:46:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:06,096 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-02-02 08:46:06,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 08:46:06,096 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-02-02 08:46:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:06,096 INFO L225 Difference]: With dead ends: 67 [2018-02-02 08:46:06,096 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 08:46:06,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 08:46:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 08:46:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-02 08:46:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 08:46:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-02 08:46:06,098 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 29 [2018-02-02 08:46:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:06,098 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-02 08:46:06,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 08:46:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-02 08:46:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:46:06,099 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:06,099 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 08:46:06,099 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:46:06,099 INFO L82 PathProgramCache]: Analyzing trace with hash 996854439, now seen corresponding path program 1 times [2018-02-02 08:46:06,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:06,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:06,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:06,100 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:06,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:06,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:06,322 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 08:46:06,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:06,322 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:46:06,334 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:06,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:06,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:46:06,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:06,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:46:06,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:06,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:06,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:46:06,394 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:06,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 08:46:06,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:06,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:06,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:06,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:46:06,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:06,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:06,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:46:06,617 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 08:46:06,634 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:06,634 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-02-02 08:46:06,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 08:46:06,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 08:46:06,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:46:06,635 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 23 states. [2018-02-02 08:46:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:07,174 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-02 08:46:07,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 08:46:07,174 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-02-02 08:46:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:07,174 INFO L225 Difference]: With dead ends: 43 [2018-02-02 08:46:07,174 INFO L226 Difference]: Without dead ends: 35 [2018-02-02 08:46:07,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 08:46:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-02 08:46:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-02-02 08:46:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 08:46:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-02-02 08:46:07,176 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-02-02 08:46:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:07,176 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-02-02 08:46:07,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 08:46:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-02-02 08:46:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:46:07,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:07,177 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 08:46:07,177 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:46:07,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1015880638, now seen corresponding path program 2 times [2018-02-02 08:46:07,177 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:07,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:07,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:07,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:46:07,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:07,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:07,495 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 08:46:07,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:07,495 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:46:07,500 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:46:07,509 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:46:07,513 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:46:07,515 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:46:07,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:07,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:46:07,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:07,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:07,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:46:07,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:46:07,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:07,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:07,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:07,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:46:07,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:07,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:07,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-02 08:46:07,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 08:46:07,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 08:46:07,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:07,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:07,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:46:07,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-02 08:46:07,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-02-02 08:46:07,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:46:07,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:07,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:07,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:46:07,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-02-02 08:46:07,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-02 08:46:07,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-02 08:46:07,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:46:07,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:07,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:46:07,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-02 08:46:07,879 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 08:46:07,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:07,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2018-02-02 08:46:07,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 08:46:07,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 08:46:07,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-02-02 08:46:07,897 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 28 states. [2018-02-02 08:46:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:08,614 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-02 08:46:08,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:46:08,615 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2018-02-02 08:46:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:08,615 INFO L225 Difference]: With dead ends: 33 [2018-02-02 08:46:08,615 INFO L226 Difference]: Without dead ends: 33 [2018-02-02 08:46:08,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=1611, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 08:46:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-02 08:46:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-02-02 08:46:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 08:46:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-02-02 08:46:08,616 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-02-02 08:46:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:08,616 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-02-02 08:46:08,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 08:46:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-02-02 08:46:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 08:46:08,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:46:08,617 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 08:46:08,617 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 08:46:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1427528657, now seen corresponding path program 2 times [2018-02-02 08:46:08,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:46:08,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:46:08,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:08,618 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:46:08,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:46:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:46:08,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:46:08,892 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 08:46:08,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:46:08,893 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:46:08,899 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:46:08,908 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:46:08,920 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:46:08,925 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:46:08,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:46:08,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:46:08,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:08,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:46:08,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:08,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:08,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:46:08,956 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:08,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:46:08,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:46:08,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:08,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 08:46:08,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:46:08,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:46:08,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:46:09,157 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 08:46:09,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:46:09,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2018-02-02 08:46:09,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 08:46:09,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 08:46:09,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-02 08:46:09,176 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2018-02-02 08:46:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:46:09,732 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-02 08:46:09,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 08:46:09,732 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-02-02 08:46:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:46:09,733 INFO L225 Difference]: With dead ends: 38 [2018-02-02 08:46:09,733 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 08:46:09,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=1544, Unknown=0, NotChecked=0, Total=1722 [2018-02-02 08:46:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 08:46:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 08:46:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 08:46:09,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 08:46:09,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-02-02 08:46:09,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:46:09,734 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 08:46:09,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 08:46:09,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 08:46:09,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 08:46:09,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:46:09 BoogieIcfgContainer [2018-02-02 08:46:09,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:46:09,738 INFO L168 Benchmark]: Toolchain (without parser) took 12412.86 ms. Allocated memory was 401.6 MB in the beginning and 769.7 MB in the end (delta: 368.1 MB). Free memory was 359.6 MB in the beginning and 571.3 MB in the end (delta: -211.7 MB). Peak memory consumption was 156.4 MB. Max. memory is 5.3 GB. [2018-02-02 08:46:09,738 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:46:09,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.75 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:46:09,739 INFO L168 Benchmark]: Boogie Preprocessor took 30.78 ms. Allocated memory is still 401.6 MB. Free memory was 347.6 MB in the beginning and 346.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:46:09,739 INFO L168 Benchmark]: RCFGBuilder took 185.66 ms. Allocated memory is still 401.6 MB. Free memory was 346.3 MB in the beginning and 326.5 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-02 08:46:09,739 INFO L168 Benchmark]: TraceAbstraction took 12031.64 ms. Allocated memory was 401.6 MB in the beginning and 769.7 MB in the end (delta: 368.1 MB). Free memory was 326.5 MB in the beginning and 571.3 MB in the end (delta: -244.8 MB). Peak memory consumption was 123.2 MB. Max. memory is 5.3 GB. [2018-02-02 08:46:09,740 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 401.6 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.75 ms. Allocated memory is still 401.6 MB. Free memory was 358.3 MB in the beginning and 347.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.78 ms. Allocated memory is still 401.6 MB. Free memory was 347.6 MB in the beginning and 346.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 185.66 ms. Allocated memory is still 401.6 MB. Free memory was 346.3 MB in the beginning and 326.5 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12031.64 ms. Allocated memory was 401.6 MB in the beginning and 769.7 MB in the end (delta: 368.1 MB). Free memory was 326.5 MB in the beginning and 571.3 MB in the end (delta: -244.8 MB). Peak memory consumption was 123.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, 11.9s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 573 SDtfs, 952 SDslu, 3168 SDs, 0 SdLazy, 3063 SolverSat, 240 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 119 SyntacticMatches, 13 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 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, 18 MinimizatonAttempts, 93 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 583 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 559 ConstructedInterpolants, 21 QuantifiedInterpolants, 139619 SizeOfPredicates, 84 NumberOfNonLiveVariables, 991 ConjunctsInSsa, 313 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 4/74 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-46-09-745.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-46-09-745.csv Received shutdown request...