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/cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:47:16,602 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:47:16,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:47:16,614 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:47:16,614 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:47:16,615 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:47:16,616 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:47:16,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:47:16,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:47:16,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:47:16,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:47:16,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:47:16,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:47:16,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:47:16,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:47:16,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:47:16,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:47:16,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:47:16,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:47:16,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:47:16,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:47:16,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:47:16,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:47:16,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:47:16,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:47:16,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:47:16,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:47:16,633 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:47:16,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:47:16,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:47:16,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:47:16,634 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-03 22:47:16,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:47:16,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:47:16,644 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:47:16,644 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:47:16,645 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:47:16,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:47:16,645 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:47:16,645 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:47:16,645 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:47:16,645 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:47:16,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:47:16,646 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:47:16,646 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:47:16,646 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:47:16,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:47:16,646 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:47:16,647 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:47:16,647 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:47:16,647 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:47:16,647 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:47:16,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:47:16,647 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:47:16,648 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:47:16,648 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:47:16,648 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:47:16,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:47:16,699 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:47:16,704 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:47:16,706 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:47:16,706 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:47:16,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:47:16,844 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:47:16,845 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:47:16,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:47:16,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:47:16,850 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:47:16,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:47:16" (1/1) ... [2018-02-03 22:47:16,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a17581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16, skipping insertion in model container [2018-02-03 22:47:16,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:47:16" (1/1) ... [2018-02-03 22:47:16,861 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:47:16,887 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:47:16,971 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:47:16,984 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:47:16,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16 WrapperNode [2018-02-03 22:47:16,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:47:16,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:47:16,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:47:16,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:47:17,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16" (1/1) ... [2018-02-03 22:47:17,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16" (1/1) ... [2018-02-03 22:47:17,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16" (1/1) ... [2018-02-03 22:47:17,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16" (1/1) ... [2018-02-03 22:47:17,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16" (1/1) ... [2018-02-03 22:47:17,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16" (1/1) ... [2018-02-03 22:47:17,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16" (1/1) ... [2018-02-03 22:47:17,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:47:17,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:47:17,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:47:17,016 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:47:17,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16" (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-03 22:47:17,048 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:47:17,048 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:47:17,048 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcpy [2018-02-03 22:47:17,048 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:47:17,048 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:47:17,048 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:47:17,048 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:47:17,049 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:47:17,049 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:47:17,049 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:47:17,049 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcpy [2018-02-03 22:47:17,049 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:47:17,049 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:47:17,049 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:47:17,209 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:47:17,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:47:17 BoogieIcfgContainer [2018-02-03 22:47:17,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:47:17,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:47:17,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:47:17,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:47:17,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:47:16" (1/3) ... [2018-02-03 22:47:17,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c3cc96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:47:17, skipping insertion in model container [2018-02-03 22:47:17,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:16" (2/3) ... [2018-02-03 22:47:17,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c3cc96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:47:17, skipping insertion in model container [2018-02-03 22:47:17,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:47:17" (3/3) ... [2018-02-03 22:47:17,213 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:47:17,218 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:47:17,223 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-03 22:47:17,253 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:47:17,253 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:47:17,253 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:47:17,254 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:47:17,254 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:47:17,254 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:47:17,254 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:47:17,254 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:47:17,255 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:47:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-02-03 22:47:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-03 22:47:17,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:17,274 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:17,274 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash -341828685, now seen corresponding path program 1 times [2018-02-03 22:47:17,279 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:17,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:17,321 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,322 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:17,322 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:17,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:17,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-03 22:47:17,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:17,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:47:17,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:47:17,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:47:17,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:47:17,427 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-02-03 22:47:17,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:17,493 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-02-03 22:47:17,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:47:17,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-03 22:47:17,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:17,540 INFO L225 Difference]: With dead ends: 44 [2018-02-03 22:47:17,540 INFO L226 Difference]: Without dead ends: 40 [2018-02-03 22:47:17,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 22:47:17,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-03 22:47:17,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-02-03 22:47:17,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-03 22:47:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-03 22:47:17,563 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-02-03 22:47:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:17,563 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-03 22:47:17,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:47:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-03 22:47:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-03 22:47:17,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:17,564 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:17,564 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:17,564 INFO L82 PathProgramCache]: Analyzing trace with hash -341826763, now seen corresponding path program 1 times [2018-02-03 22:47:17,564 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:17,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:17,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,565 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:17,566 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:17,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:17,591 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-03 22:47:17,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:17,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 22:47:17,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:47:17,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:47:17,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:47:17,593 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-02-03 22:47:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:17,628 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-02-03 22:47:17,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:47:17,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-03 22:47:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:17,629 INFO L225 Difference]: With dead ends: 39 [2018-02-03 22:47:17,630 INFO L226 Difference]: Without dead ends: 38 [2018-02-03 22:47:17,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:47:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-03 22:47:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-03 22:47:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-03 22:47:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-03 22:47:17,634 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-02-03 22:47:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:17,634 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-03 22:47:17,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:47:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-03 22:47:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:47:17,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:17,635 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:17,635 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:17,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659641, now seen corresponding path program 1 times [2018-02-03 22:47:17,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:17,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:17,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,637 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:17,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:17,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:17,684 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-03 22:47:17,685 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:17,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:17,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:47:17,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:47:17,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:47:17,686 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-02-03 22:47:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:17,734 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-03 22:47:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:47:17,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:47:17,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:17,735 INFO L225 Difference]: With dead ends: 36 [2018-02-03 22:47:17,735 INFO L226 Difference]: Without dead ends: 36 [2018-02-03 22:47:17,735 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-03 22:47:17,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-03 22:47:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-03 22:47:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-03 22:47:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-03 22:47:17,737 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-02-03 22:47:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:17,738 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-03 22:47:17,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:47:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-03 22:47:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:47:17,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:17,738 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:17,738 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:17,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1560659640, now seen corresponding path program 1 times [2018-02-03 22:47:17,739 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:17,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:17,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,739 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:17,739 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:17,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:17,806 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-03 22:47:17,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:17,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:47:17,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:17,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:17,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:17,807 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-02-03 22:47:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:17,850 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-02-03 22:47:17,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:17,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:47:17,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:17,851 INFO L225 Difference]: With dead ends: 35 [2018-02-03 22:47:17,851 INFO L226 Difference]: Without dead ends: 35 [2018-02-03 22:47:17,851 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-03 22:47:17,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-02-03 22:47:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-02-03 22:47:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-02-03 22:47:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-02-03 22:47:17,854 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-02-03 22:47:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:17,854 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-02-03 22:47:17,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-02-03 22:47:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 22:47:17,855 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:17,855 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-03 22:47:17,855 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash -394620288, now seen corresponding path program 1 times [2018-02-03 22:47:17,856 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:17,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:17,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:17,857 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:17,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:17,905 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-03 22:47:17,905 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:17,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:17,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:47:17,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:47:17,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:17,906 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-02-03 22:47:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:17,949 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-02-03 22:47:17,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:17,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-03 22:47:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:17,950 INFO L225 Difference]: With dead ends: 34 [2018-02-03 22:47:17,950 INFO L226 Difference]: Without dead ends: 34 [2018-02-03 22:47:17,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:47:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-03 22:47:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-02-03 22:47:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-03 22:47:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-02-03 22:47:17,952 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 19 [2018-02-03 22:47:17,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:17,952 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-02-03 22:47:17,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:47:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-02-03 22:47:17,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-03 22:47:17,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:17,953 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-03 22:47:17,953 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:17,953 INFO L82 PathProgramCache]: Analyzing trace with hash -394620287, now seen corresponding path program 1 times [2018-02-03 22:47:17,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:17,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:17,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:17,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:17,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:18,031 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-03 22:47:18,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:18,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:47:18,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:47:18,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:47:18,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:18,031 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 9 states. [2018-02-03 22:47:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:18,131 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-03 22:47:18,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:47:18,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-03 22:47:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:18,132 INFO L225 Difference]: With dead ends: 41 [2018-02-03 22:47:18,132 INFO L226 Difference]: Without dead ends: 41 [2018-02-03 22:47:18,133 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:18,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-03 22:47:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-02-03 22:47:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-03 22:47:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-03 22:47:18,136 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 19 [2018-02-03 22:47:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:18,136 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-03 22:47:18,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:47:18,136 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-03 22:47:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:47:18,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:18,137 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] [2018-02-03 22:47:18,137 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:18,137 INFO L82 PathProgramCache]: Analyzing trace with hash 651672940, now seen corresponding path program 1 times [2018-02-03 22:47:18,137 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:18,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:18,138 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:18,138 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:18,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:18,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:18,217 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-03 22:47:18,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:18,218 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:47:18,218 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:47:18,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:47:18,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:18,218 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 9 states. [2018-02-03 22:47:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:18,285 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-03 22:47:18,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:47:18,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-03 22:47:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:18,286 INFO L225 Difference]: With dead ends: 36 [2018-02-03 22:47:18,286 INFO L226 Difference]: Without dead ends: 36 [2018-02-03 22:47:18,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-03 22:47:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-03 22:47:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-03 22:47:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-02-03 22:47:18,289 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 20 [2018-02-03 22:47:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:18,289 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-02-03 22:47:18,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:47:18,289 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-02-03 22:47:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:47:18,290 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:18,290 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] [2018-02-03 22:47:18,290 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash 651672941, now seen corresponding path program 1 times [2018-02-03 22:47:18,290 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:18,291 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:18,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:18,291 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:18,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:18,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:18,379 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-03 22:47:18,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:18,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:47:18,379 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:47:18,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:47:18,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:18,379 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-02-03 22:47:18,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:18,488 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-03 22:47:18,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:47:18,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-03 22:47:18,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:18,488 INFO L225 Difference]: With dead ends: 38 [2018-02-03 22:47:18,489 INFO L226 Difference]: Without dead ends: 38 [2018-02-03 22:47:18,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:47:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-03 22:47:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-02-03 22:47:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-03 22:47:18,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-03 22:47:18,490 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 20 [2018-02-03 22:47:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:18,491 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-03 22:47:18,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:47:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-03 22:47:18,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:47:18,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:18,491 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] [2018-02-03 22:47:18,491 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:18,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1352456705, now seen corresponding path program 1 times [2018-02-03 22:47:18,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:18,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:18,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:18,496 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:18,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:18,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:18,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:18,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 22:47:18,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 22:47:18,594 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 22:47:18,594 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:47:18,594 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-02-03 22:47:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:18,722 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-02-03 22:47:18,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:47:18,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-03 22:47:18,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:18,723 INFO L225 Difference]: With dead ends: 60 [2018-02-03 22:47:18,723 INFO L226 Difference]: Without dead ends: 60 [2018-02-03 22:47:18,723 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-03 22:47:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-03 22:47:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-02-03 22:47:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:47:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-02-03 22:47:18,726 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 24 [2018-02-03 22:47:18,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:18,726 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-02-03 22:47:18,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 22:47:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-02-03 22:47:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:47:18,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:18,727 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] [2018-02-03 22:47:18,727 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:18,727 INFO L82 PathProgramCache]: Analyzing trace with hash -235891197, now seen corresponding path program 1 times [2018-02-03 22:47:18,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:18,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:18,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:18,728 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:18,728 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:18,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:18,850 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-03 22:47:18,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:18,851 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-03 22:47:18,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:18,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:18,923 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-03 22:47:18,926 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-03 22:47:18,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:18,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:18,939 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-03 22:47:18,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:47:19,054 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-03 22:47:19,061 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-03 22:47:19,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:19,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:19,070 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-03 22:47:19,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-03 22:47:19,099 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-03 22:47:19,115 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:19,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-02-03 22:47:19,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-03 22:47:19,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-03 22:47:19,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:47:19,116 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 17 states. [2018-02-03 22:47:19,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:19,507 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-03 22:47:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:47:19,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-02-03 22:47:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:19,510 INFO L225 Difference]: With dead ends: 60 [2018-02-03 22:47:19,510 INFO L226 Difference]: Without dead ends: 60 [2018-02-03 22:47:19,511 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-02-03 22:47:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-03 22:47:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-03 22:47:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-03 22:47:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-03 22:47:19,515 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 24 [2018-02-03 22:47:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:19,515 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-03 22:47:19,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-03 22:47:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-03 22:47:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 22:47:19,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:19,516 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] [2018-02-03 22:47:19,516 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1277307435, now seen corresponding path program 1 times [2018-02-03 22:47:19,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:19,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:19,517 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:19,518 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:19,518 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:19,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:19,741 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-03 22:47:19,742 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:19,742 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-03 22:47:19,750 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:19,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:19,781 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-03 22:47:19,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:19,786 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-03 22:47:19,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:19,791 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-03 22:47:19,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-02-03 22:47:19,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:19,833 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:19,836 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-03 22:47:19,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:19,848 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-03 22:47:19,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:19,854 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-03 22:47:19,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-02-03 22:47:20,086 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-03 22:47:20,104 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:20,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-02-03 22:47:20,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 22:47:20,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 22:47:20,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:47:20,105 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 26 states. [2018-02-03 22:47:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:20,689 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-03 22:47:20,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:47:20,689 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-02-03 22:47:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:20,690 INFO L225 Difference]: With dead ends: 61 [2018-02-03 22:47:20,690 INFO L226 Difference]: Without dead ends: 61 [2018-02-03 22:47:20,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2018-02-03 22:47:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-03 22:47:20,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-02-03 22:47:20,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-03 22:47:20,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-02-03 22:47:20,693 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 25 [2018-02-03 22:47:20,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:20,693 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-02-03 22:47:20,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 22:47:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-02-03 22:47:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:47:20,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:20,694 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:20,694 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1119438913, now seen corresponding path program 2 times [2018-02-03 22:47:20,694 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:20,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:20,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:20,695 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:20,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:20,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:21,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:21,005 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-03 22:47:21,010 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:47:21,025 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:47:21,025 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:47:21,027 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:21,031 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-03 22:47:21,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:21,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:21,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 22:47:21,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:21,038 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:21,039 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-03 22:47:21,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:21,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-02-03 22:47:21,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:21,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:21,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-03 22:47:21,073 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-03 22:47:21,074 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-03 22:47:21,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:21,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:21,079 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-03 22:47:21,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-03 22:47:21,204 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-03 22:47:21,205 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-03 22:47:21,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:21,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:21,214 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-03 22:47:21,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-02-03 22:47:21,272 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-03 22:47:21,277 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-03 22:47:21,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:21,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:21,285 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-03 22:47:21,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-03 22:47:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:21,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:21,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-02-03 22:47:21,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 22:47:21,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 22:47:21,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:47:21,335 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 26 states. [2018-02-03 22:47:22,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:22,120 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-03 22:47:22,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 22:47:22,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2018-02-03 22:47:22,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:22,121 INFO L225 Difference]: With dead ends: 60 [2018-02-03 22:47:22,121 INFO L226 Difference]: Without dead ends: 60 [2018-02-03 22:47:22,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1601, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 22:47:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-03 22:47:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-02-03 22:47:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 22:47:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-02-03 22:47:22,124 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 29 [2018-02-03 22:47:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:22,124 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-02-03 22:47:22,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 22:47:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-02-03 22:47:22,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:47:22,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:22,125 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:22,125 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcpyErr2RequiresViolation, cstrcpyErr3RequiresViolation, cstrcpyErr0RequiresViolation, cstrcpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-03 22:47:22,125 INFO L82 PathProgramCache]: Analyzing trace with hash 216235552, now seen corresponding path program 1 times [2018-02-03 22:47:22,125 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:22,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:22,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:22,126 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:47:22,126 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:22,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:22,198 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-03 22:47:22,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:22,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:22,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:47:22,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:47:22,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:22,199 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 6 states. [2018-02-03 22:47:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:22,241 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-02-03 22:47:22,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:47:22,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-03 22:47:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:22,242 INFO L225 Difference]: With dead ends: 46 [2018-02-03 22:47:22,242 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:47:22,242 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-03 22:47:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:47:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:47:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:47:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:47:22,242 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-02-03 22:47:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:22,242 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:47:22,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:47:22,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:47:22,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:47:22,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:47:22 BoogieIcfgContainer [2018-02-03 22:47:22,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:47:22,246 INFO L168 Benchmark]: Toolchain (without parser) took 5401.52 ms. Allocated memory was 391.6 MB in the beginning and 700.4 MB in the end (delta: 308.8 MB). Free memory was 347.0 MB in the beginning and 458.0 MB in the end (delta: -110.9 MB). Peak memory consumption was 197.9 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:22,248 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 391.6 MB. Free memory is still 352.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:47:22,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.84 ms. Allocated memory is still 391.6 MB. Free memory was 345.7 MB in the beginning and 336.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:22,248 INFO L168 Benchmark]: Boogie Preprocessor took 25.92 ms. Allocated memory is still 391.6 MB. Free memory was 336.4 MB in the beginning and 333.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:22,248 INFO L168 Benchmark]: RCFGBuilder took 193.28 ms. Allocated memory is still 391.6 MB. Free memory was 333.8 MB in the beginning and 316.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:22,249 INFO L168 Benchmark]: TraceAbstraction took 5036.13 ms. Allocated memory was 391.6 MB in the beginning and 700.4 MB in the end (delta: 308.8 MB). Free memory was 315.3 MB in the beginning and 458.0 MB in the end (delta: -142.7 MB). Peak memory consumption was 166.1 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:22,250 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 391.6 MB. Free memory is still 352.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 143.84 ms. Allocated memory is still 391.6 MB. Free memory was 345.7 MB in the beginning and 336.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.92 ms. Allocated memory is still 391.6 MB. Free memory was 336.4 MB in the beginning and 333.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 193.28 ms. Allocated memory is still 391.6 MB. Free memory was 333.8 MB in the beginning and 316.6 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5036.13 ms. Allocated memory was 391.6 MB in the beginning and 700.4 MB in the end (delta: 308.8 MB). Free memory was 315.3 MB in the beginning and 458.0 MB in the end (delta: -142.7 MB). Peak memory consumption was 166.1 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: 548]: 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 7 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 7 error locations. SAFE Result, 4.9s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 361 SDtfs, 457 SDslu, 1810 SDs, 0 SdLazy, 1594 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=10, 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, 13 MinimizatonAttempts, 36 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 320 ConstructedInterpolants, 16 QuantifiedInterpolants, 60519 SizeOfPredicates, 44 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 3/39 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/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-47-22-256.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-47-22-256.csv Received shutdown request...