java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:09:50,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:09:50,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:09:50,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:09:50,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:09:50,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:09:50,327 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:09:50,328 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:09:50,330 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:09:50,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:09:50,331 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:09:50,331 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:09:50,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:09:50,333 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:09:50,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:09:50,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:09:50,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:09:50,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:09:50,340 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:09:50,341 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:09:50,342 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:09:50,343 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:09:50,343 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:09:50,344 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:09:50,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:09:50,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:09:50,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:09:50,346 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:09:50,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:09:50,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:09:50,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:09:50,347 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:09:50,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:09:50,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:09:50,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:09:50,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:09:50,358 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:09:50,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:09:50,358 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:09:50,359 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:09:50,359 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:09:50,359 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:09:50,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:09:50,359 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:09:50,359 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:09:50,360 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:09:50,360 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:09:50,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:09:50,360 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:09:50,360 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:09:50,360 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:09:50,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:09:50,361 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:09:50,361 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:09:50,361 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:09:50,361 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:09:50,390 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:09:50,401 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:09:50,404 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:09:50,406 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:09:50,406 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:09:50,408 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-04 12:09:50,547 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:09:50,548 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:09:50,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:09:50,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:09:50,553 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:09:50,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:09:50" (1/1) ... [2018-02-04 12:09:50,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfe84f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50, skipping insertion in model container [2018-02-04 12:09:50,556 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:09:50" (1/1) ... [2018-02-04 12:09:50,566 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:09:50,595 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:09:50,687 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:09:50,703 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:09:50,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50 WrapperNode [2018-02-04 12:09:50,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:09:50,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:09:50,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:09:50,710 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:09:50,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50" (1/1) ... [2018-02-04 12:09:50,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50" (1/1) ... [2018-02-04 12:09:50,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50" (1/1) ... [2018-02-04 12:09:50,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50" (1/1) ... [2018-02-04 12:09:50,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50" (1/1) ... [2018-02-04 12:09:50,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50" (1/1) ... [2018-02-04 12:09:50,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50" (1/1) ... [2018-02-04 12:09:50,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:09:50,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:09:50,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:09:50,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:09:50,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:09:50,775 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:09:50,776 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:09:50,776 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-02-04 12:09:50,776 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:09:50,776 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:09:50,776 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:09:50,776 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:09:50,776 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:09:50,776 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:09:50,776 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:09:50,776 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-02-04 12:09:50,776 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:09:50,776 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:09:50,777 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:09:50,929 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:09:50,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:09:50 BoogieIcfgContainer [2018-02-04 12:09:50,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:09:50,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:09:50,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:09:50,932 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:09:50,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:09:50" (1/3) ... [2018-02-04 12:09:50,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732b2c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:09:50, skipping insertion in model container [2018-02-04 12:09:50,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:09:50" (2/3) ... [2018-02-04 12:09:50,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732b2c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:09:50, skipping insertion in model container [2018-02-04 12:09:50,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:09:50" (3/3) ... [2018-02-04 12:09:50,934 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:09:50,940 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:09:50,945 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 12:09:50,976 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:09:50,976 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:09:50,976 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:09:50,976 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:09:50,976 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:09:50,976 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:09:50,976 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:09:50,976 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:09:50,977 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:09:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-02-04 12:09:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:09:50,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:50,994 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:50,994 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash -428881312, now seen corresponding path program 1 times [2018-02-04 12:09:51,001 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:51,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:51,030 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:51,031 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:51,031 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:51,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:51,125 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:51,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:09:51,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:09:51,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:09:51,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:09:51,139 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-02-04 12:09:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:51,207 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-04 12:09:51,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:09:51,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:09:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:51,215 INFO L225 Difference]: With dead ends: 47 [2018-02-04 12:09:51,215 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 12:09:51,288 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:09:51,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 12:09:51,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 12:09:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 12:09:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-04 12:09:51,320 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-02-04 12:09:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:51,320 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-04 12:09:51,320 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:09:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-04 12:09:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:09:51,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:51,321 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:51,321 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:51,321 INFO L82 PathProgramCache]: Analyzing trace with hash -428881311, now seen corresponding path program 1 times [2018-02-04 12:09:51,322 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:51,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:51,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:51,323 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:51,323 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:51,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:51,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:51,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:09:51,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:09:51,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:09:51,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:09:51,416 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-02-04 12:09:51,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:51,443 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-04 12:09:51,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:09:51,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 12:09:51,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:51,444 INFO L225 Difference]: With dead ends: 43 [2018-02-04 12:09:51,444 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 12:09:51,444 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:09:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 12:09:51,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-04 12:09:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 12:09:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-04 12:09:51,447 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 13 [2018-02-04 12:09:51,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:51,448 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-04 12:09:51,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:09:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-04 12:09:51,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:09:51,449 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:51,449 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:51,449 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:51,449 INFO L82 PathProgramCache]: Analyzing trace with hash 551620863, now seen corresponding path program 1 times [2018-02-04 12:09:51,449 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:51,449 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:51,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:51,450 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:51,450 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:51,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:51,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:51,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:09:51,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:09:51,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:09:51,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:09:51,517 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-02-04 12:09:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:51,635 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-02-04 12:09:51,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:09:51,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-02-04 12:09:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:51,637 INFO L225 Difference]: With dead ends: 45 [2018-02-04 12:09:51,637 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 12:09:51,638 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-04 12:09:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 12:09:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-02-04 12:09:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 12:09:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-04 12:09:51,641 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 18 [2018-02-04 12:09:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:51,641 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-04 12:09:51,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:09:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-04 12:09:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 12:09:51,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:51,641 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:51,641 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:51,642 INFO L82 PathProgramCache]: Analyzing trace with hash 551620864, now seen corresponding path program 1 times [2018-02-04 12:09:51,642 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:51,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:51,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:51,642 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:51,643 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:51,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:51,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:51,752 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:51,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:09:51,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:09:51,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:09:51,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:09:51,753 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2018-02-04 12:09:51,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:51,979 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-02-04 12:09:51,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:09:51,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-02-04 12:09:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:51,981 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:09:51,981 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 12:09:51,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-04 12:09:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 12:09:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-02-04 12:09:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 12:09:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-04 12:09:51,986 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 18 [2018-02-04 12:09:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:51,986 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-04 12:09:51,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:09:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-04 12:09:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:09:51,987 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:51,987 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:51,987 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash -79622450, now seen corresponding path program 1 times [2018-02-04 12:09:51,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:51,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:51,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:51,988 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:51,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:52,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:52,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:52,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:09:52,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:09:52,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:09:52,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:09:52,104 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-02-04 12:09:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:52,221 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-04 12:09:52,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:09:52,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-02-04 12:09:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:52,222 INFO L225 Difference]: With dead ends: 46 [2018-02-04 12:09:52,222 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 12:09:52,222 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-04 12:09:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 12:09:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-04 12:09:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 12:09:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-04 12:09:52,225 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-02-04 12:09:52,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:52,225 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-04 12:09:52,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:09:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-04 12:09:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 12:09:52,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:52,225 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:52,225 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:52,225 INFO L82 PathProgramCache]: Analyzing trace with hash -79622449, now seen corresponding path program 1 times [2018-02-04 12:09:52,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:52,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:52,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,226 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:52,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:52,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:52,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:52,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:52,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 12:09:52,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:09:52,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:09:52,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:09:52,319 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-02-04 12:09:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:52,427 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-02-04 12:09:52,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:09:52,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-02-04 12:09:52,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:52,427 INFO L225 Difference]: With dead ends: 45 [2018-02-04 12:09:52,428 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 12:09:52,428 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-04 12:09:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 12:09:52,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-02-04 12:09:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 12:09:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-04 12:09:52,430 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 19 [2018-02-04 12:09:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:52,430 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-04 12:09:52,430 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:09:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-04 12:09:52,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:09:52,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:52,431 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:52,431 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:52,431 INFO L82 PathProgramCache]: Analyzing trace with hash 670305991, now seen corresponding path program 1 times [2018-02-04 12:09:52,431 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:52,432 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:52,432 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,433 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:52,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:52,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:52,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:52,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:09:52,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:09:52,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:09:52,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:09:52,472 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-02-04 12:09:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:52,519 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-02-04 12:09:52,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:09:52,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 12:09:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:52,520 INFO L225 Difference]: With dead ends: 46 [2018-02-04 12:09:52,520 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 12:09:52,520 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-04 12:09:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 12:09:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-02-04 12:09:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 12:09:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-04 12:09:52,523 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-02-04 12:09:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:52,523 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-04 12:09:52,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:09:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-04 12:09:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:09:52,524 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:52,524 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:52,524 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:52,524 INFO L82 PathProgramCache]: Analyzing trace with hash 670305992, now seen corresponding path program 1 times [2018-02-04 12:09:52,524 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:52,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:52,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,525 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:52,525 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:52,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:52,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:52,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:09:52,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:09:52,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:09:52,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:09:52,657 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-02-04 12:09:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:52,753 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-02-04 12:09:52,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:09:52,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 12:09:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:52,755 INFO L225 Difference]: With dead ends: 96 [2018-02-04 12:09:52,755 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 12:09:52,755 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-04 12:09:52,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 12:09:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2018-02-04 12:09:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 12:09:52,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-02-04 12:09:52,760 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 24 [2018-02-04 12:09:52,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:52,760 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-02-04 12:09:52,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:09:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-02-04 12:09:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:09:52,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:52,761 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-04 12:09:52,761 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:52,761 INFO L82 PathProgramCache]: Analyzing trace with hash 689332191, now seen corresponding path program 1 times [2018-02-04 12:09:52,761 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:52,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:52,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,762 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:52,762 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:52,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:52,879 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-04 12:09:52,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:52,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:09:52,880 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:09:52,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:09:52,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:09:52,880 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 7 states. [2018-02-04 12:09:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:52,922 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-02-04 12:09:52,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:09:52,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 12:09:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:52,923 INFO L225 Difference]: With dead ends: 70 [2018-02-04 12:09:52,923 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 12:09:52,923 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-04 12:09:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 12:09:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-02-04 12:09:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 12:09:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-02-04 12:09:52,926 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 24 [2018-02-04 12:09:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:52,926 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-02-04 12:09:52,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:09:52,926 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-02-04 12:09:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:09:52,926 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:52,927 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:52,927 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:52,927 INFO L82 PathProgramCache]: Analyzing trace with hash -918041910, now seen corresponding path program 1 times [2018-02-04 12:09:52,927 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:52,927 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:52,927 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,927 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:52,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:52,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:53,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:53,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:53,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 12:09:53,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:09:53,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:09:53,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:09:53,077 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 13 states. [2018-02-04 12:09:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:53,247 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-02-04 12:09:53,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:09:53,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-04 12:09:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:53,248 INFO L225 Difference]: With dead ends: 73 [2018-02-04 12:09:53,248 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 12:09:53,248 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-04 12:09:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 12:09:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-02-04 12:09:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 12:09:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-02-04 12:09:53,251 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2018-02-04 12:09:53,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:53,252 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-02-04 12:09:53,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:09:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-02-04 12:09:53,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:09:53,253 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:53,253 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-04 12:09:53,255 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:53,255 INFO L82 PathProgramCache]: Analyzing trace with hash -899015711, now seen corresponding path program 1 times [2018-02-04 12:09:53,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:53,255 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:53,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:53,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:53,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:53,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:53,373 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-04 12:09:53,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:53,373 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:09:53,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:09:53,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:09:53,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:09:53,374 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 11 states. [2018-02-04 12:09:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:53,491 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-02-04 12:09:53,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:09:53,491 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-02-04 12:09:53,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:53,493 INFO L225 Difference]: With dead ends: 119 [2018-02-04 12:09:53,494 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 12:09:53,494 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-04 12:09:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 12:09:53,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-02-04 12:09:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-02-04 12:09:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-02-04 12:09:53,498 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 24 [2018-02-04 12:09:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:53,499 INFO L432 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-02-04 12:09:53,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:09:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-02-04 12:09:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 12:09:53,499 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:53,499 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-04 12:09:53,499 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:53,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1401806879, now seen corresponding path program 1 times [2018-02-04 12:09:53,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:53,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:53,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:53,500 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:53,500 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:53,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:53,652 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-04 12:09:53,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:53,652 INFO L213 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-04 12:09:53,658 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:53,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:53,743 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-04 12:09:53,746 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-04 12:09:53,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:53,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:53,757 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-04 12:09:53,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:09:53,891 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-04 12:09:53,899 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-04 12:09:53,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:09:53,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:09:53,915 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-04 12:09:53,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-04 12:09:53,965 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-04 12:09:53,995 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:09:53,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-02-04 12:09:53,996 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:09:53,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:09:53,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:09:53,997 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 19 states. [2018-02-04 12:09:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:56,505 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2018-02-04 12:09:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:09:56,505 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-02-04 12:09:56,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:56,506 INFO L225 Difference]: With dead ends: 137 [2018-02-04 12:09:56,506 INFO L226 Difference]: Without dead ends: 137 [2018-02-04 12:09:56,506 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:09:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-02-04 12:09:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-02-04 12:09:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-04 12:09:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-02-04 12:09:56,511 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 24 [2018-02-04 12:09:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:56,511 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-02-04 12:09:56,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:09:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-02-04 12:09:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:09:56,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:56,512 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-04 12:09:56,512 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:56,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1797191857, now seen corresponding path program 1 times [2018-02-04 12:09:56,512 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:56,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:56,512 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:56,513 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:56,513 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:56,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:56,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:09:56,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:09:56,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:09:56,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:09:56,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:09:56,596 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 6 states. [2018-02-04 12:09:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:56,680 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2018-02-04 12:09:56,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:09:56,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 12:09:56,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:56,681 INFO L225 Difference]: With dead ends: 114 [2018-02-04 12:09:56,681 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 12:09:56,681 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:09:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 12:09:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-02-04 12:09:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:09:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-02-04 12:09:56,684 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 25 [2018-02-04 12:09:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:56,684 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-02-04 12:09:56,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:09:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-02-04 12:09:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:09:56,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:56,685 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-04 12:09:56,685 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash 506340240, now seen corresponding path program 1 times [2018-02-04 12:09:56,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:56,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:56,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:56,686 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:56,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:56,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:56,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:56,822 INFO L213 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-04 12:09:56,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:56,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:56,849 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-04 12:09:56,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:56,866 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-04 12:09:56,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:56,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:56,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:09:56,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:56,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:56,900 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-04 12:09:56,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:56,909 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-04 12:09:56,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:56,913 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-04 12:09:56,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:09:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:57,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:09:57,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-02-04 12:09:57,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:09:57,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:09:57,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:09:57,098 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 26 states. [2018-02-04 12:09:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:57,453 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-02-04 12:09:57,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:09:57,454 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-02-04 12:09:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:57,454 INFO L225 Difference]: With dead ends: 57 [2018-02-04 12:09:57,454 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 12:09:57,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:09:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 12:09:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-02-04 12:09:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 12:09:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-04 12:09:57,456 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-02-04 12:09:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:57,456 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-04 12:09:57,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:09:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-04 12:09:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:09:57,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:57,456 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:09:57,457 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash -183633860, now seen corresponding path program 1 times [2018-02-04 12:09:57,457 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:57,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:57,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:57,457 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:57,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:57,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:57,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:57,682 INFO L213 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-04 12:09:57,690 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:57,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:57,722 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-04 12:09:57,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:57,728 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-04 12:09:57,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:57,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:57,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:09:57,743 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:57,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:57,745 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-04 12:09:57,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:57,752 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-04 12:09:57,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:57,757 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-04 12:09:57,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:09:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:57,987 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:09:57,987 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-02-04 12:09:57,987 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 12:09:57,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 12:09:57,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:09:57,988 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 23 states. [2018-02-04 12:09:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:58,618 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-02-04 12:09:58,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:09:58,619 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-02-04 12:09:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:58,619 INFO L225 Difference]: With dead ends: 67 [2018-02-04 12:09:58,619 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 12:09:58,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 12:09:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 12:09:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 12:09:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 12:09:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-04 12:09:58,621 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 29 [2018-02-04 12:09:58,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:58,621 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-04 12:09:58,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 12:09:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-04 12:09:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:09:58,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:58,621 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-04 12:09:58,621 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:58,621 INFO L82 PathProgramCache]: Analyzing trace with hash 996854439, now seen corresponding path program 1 times [2018-02-04 12:09:58,621 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:58,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:58,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:58,622 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:58,622 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:58,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:58,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:58,830 INFO L213 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-04 12:09:58,840 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:58,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:58,874 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-04 12:09:58,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:58,881 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-04 12:09:58,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:58,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:58,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:09:58,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:58,898 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-04 12:09:58,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:58,909 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:58,910 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:58,910 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-04 12:09:58,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:58,915 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-04 12:09:58,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:09:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:09:59,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:09:59,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-02-04 12:09:59,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 12:09:59,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 12:09:59,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:09:59,097 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 23 states. [2018-02-04 12:09:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:09:59,606 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 12:09:59,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:09:59,606 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-02-04 12:09:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:09:59,606 INFO L225 Difference]: With dead ends: 43 [2018-02-04 12:09:59,606 INFO L226 Difference]: Without dead ends: 35 [2018-02-04 12:09:59,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 12:09:59,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-04 12:09:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-02-04 12:09:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-04 12:09:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-02-04 12:09:59,608 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-02-04 12:09:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:09:59,608 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-02-04 12:09:59,608 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 12:09:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-02-04 12:09:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:09:59,608 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:09:59,608 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-04 12:09:59,609 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:09:59,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1015880638, now seen corresponding path program 2 times [2018-02-04 12:09:59,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:09:59,609 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:09:59,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:59,609 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:09:59,609 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:09:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:09:59,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:09:59,907 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-04 12:09:59,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:09:59,907 INFO L213 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-04 12:09:59,912 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:09:59,926 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:09:59,926 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:09:59,928 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:09:59,931 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-04 12:09:59,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:59,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:59,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:09:59,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-04 12:09:59,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:59,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:59,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:09:59,942 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-04 12:09:59,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:59,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:59,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 12:09:59,978 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-04 12:09:59,979 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-04 12:09:59,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:09:59,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:09:59,983 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-04 12:09:59,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-04 12:10:00,144 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-04 12:10:00,146 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-04 12:10:00,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:00,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:00,154 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-04 12:10:00,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-02-04 12:10:00,210 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-04 12:10:00,219 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-04 12:10:00,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:00,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:00,228 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-04 12:10:00,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-04 12:10:00,259 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-04 12:10:00,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:00,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2018-02-04 12:10:00,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:10:00,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:10:00,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:10:00,277 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 28 states. [2018-02-04 12:10:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:01,002 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-04 12:10:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:10:01,002 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2018-02-04 12:10:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:01,002 INFO L225 Difference]: With dead ends: 33 [2018-02-04 12:10:01,002 INFO L226 Difference]: Without dead ends: 33 [2018-02-04 12:10:01,003 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-04 12:10:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-04 12:10:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-02-04 12:10:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 12:10:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-02-04 12:10:01,004 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-02-04 12:10:01,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:01,004 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-02-04 12:10:01,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:10:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-02-04 12:10:01,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:10:01,005 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:01,005 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-04 12:10:01,005 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 12:10:01,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1427528657, now seen corresponding path program 2 times [2018-02-04 12:10:01,005 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:01,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:01,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:01,006 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:10:01,006 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:01,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:01,172 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-04 12:10:01,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:01,173 INFO L213 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-04 12:10:01,177 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:10:01,197 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:10:01,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:10:01,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:01,235 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-04 12:10:01,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:01,239 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-04 12:10:01,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:01,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:01,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:10:01,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:01,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:01,252 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-04 12:10:01,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:01,260 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-04 12:10:01,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:01,263 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-04 12:10:01,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:10:01,487 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-04 12:10:01,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:01,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2018-02-04 12:10:01,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 12:10:01,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 12:10:01,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:10:01,505 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 25 states. [2018-02-04 12:10:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:02,081 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-04 12:10:02,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:10:02,082 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2018-02-04 12:10:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:02,082 INFO L225 Difference]: With dead ends: 38 [2018-02-04 12:10:02,082 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:10:02,082 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-04 12:10:02,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:10:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:10:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:10:02,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:10:02,083 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-02-04 12:10:02,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:02,083 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:10:02,083 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 12:10:02,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:10:02,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:10:02,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:10:02 BoogieIcfgContainer [2018-02-04 12:10:02,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:10:02,087 INFO L168 Benchmark]: Toolchain (without parser) took 11539.75 ms. Allocated memory was 399.0 MB in the beginning and 756.5 MB in the end (delta: 357.6 MB). Free memory was 357.2 MB in the beginning and 594.9 MB in the end (delta: -237.8 MB). Peak memory consumption was 119.8 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:02,088 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:10:02,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.89 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 345.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:02,088 INFO L168 Benchmark]: Boogie Preprocessor took 26.53 ms. Allocated memory is still 399.0 MB. Free memory was 345.2 MB in the beginning and 343.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:02,088 INFO L168 Benchmark]: RCFGBuilder took 193.28 ms. Allocated memory is still 399.0 MB. Free memory was 343.9 MB in the beginning and 324.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:02,088 INFO L168 Benchmark]: TraceAbstraction took 11156.31 ms. Allocated memory was 399.0 MB in the beginning and 756.5 MB in the end (delta: 357.6 MB). Free memory was 324.6 MB in the beginning and 594.9 MB in the end (delta: -270.4 MB). Peak memory consumption was 87.2 MB. Max. memory is 5.3 GB. [2018-02-04 12:10:02,089 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 160.89 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 345.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.53 ms. Allocated memory is still 399.0 MB. Free memory was 345.2 MB in the beginning and 343.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 193.28 ms. Allocated memory is still 399.0 MB. Free memory was 343.9 MB in the beginning and 324.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11156.31 ms. Allocated memory was 399.0 MB in the beginning and 756.5 MB in the end (delta: 357.6 MB). Free memory was 324.6 MB in the beginning and 594.9 MB in the end (delta: -270.4 MB). Peak memory consumption was 87.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.1s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 6.5s 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.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 119 SyntacticMatches, 13 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 5.2s 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.2s SatisfiabilityAnalysisTime, 3.7s 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-04_12-10-02-096.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-04_12-10-02-096.csv Received shutdown request...