java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:37:47,617 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:37:47,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:37:47,630 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:37:47,631 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:37:47,631 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:37:47,632 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:37:47,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:37:47,635 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:37:47,636 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:37:47,636 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:37:47,637 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:37:47,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:37:47,638 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:37:47,639 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:37:47,641 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:37:47,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:37:47,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:37:47,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:37:47,646 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:37:47,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:37:47,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:37:47,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:37:47,649 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:37:47,650 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:37:47,651 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:37:47,651 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:37:47,651 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:37:47,652 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:37:47,652 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:37:47,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:37:47,652 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:37:47,662 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:37:47,662 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:37:47,663 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:37:47,663 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:37:47,663 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:37:47,663 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:37:47,663 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:37:47,663 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:37:47,664 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:37:47,664 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:37:47,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:37:47,664 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:37:47,664 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:37:47,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:37:47,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:37:47,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:37:47,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:37:47,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:37:47,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:37:47,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:37:47,665 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:37:47,665 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:37:47,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:37:47,666 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:37:47,693 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:37:47,704 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:37:47,707 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:37:47,708 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:37:47,709 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:37:47,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:37:47,855 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:37:47,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:37:47,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:37:47,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:37:47,863 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:37:47,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:37:47" (1/1) ... [2018-02-04 17:37:47,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32677a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:47, skipping insertion in model container [2018-02-04 17:37:47,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:37:47" (1/1) ... [2018-02-04 17:37:47,881 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:37:47,910 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:37:47,994 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:37:48,006 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:37:48,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:48 WrapperNode [2018-02-04 17:37:48,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:37:48,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:37:48,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:37:48,013 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:37:48,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:48" (1/1) ... [2018-02-04 17:37:48,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:48" (1/1) ... [2018-02-04 17:37:48,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:48" (1/1) ... [2018-02-04 17:37:48,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:48" (1/1) ... [2018-02-04 17:37:48,038 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:48" (1/1) ... [2018-02-04 17:37:48,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:48" (1/1) ... [2018-02-04 17:37:48,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:48" (1/1) ... [2018-02-04 17:37:48,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:37:48,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:37:48,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:37:48,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:37:48,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:48" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:37:48,088 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:37:48,088 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:37:48,088 INFO L136 BoogieDeclarations]: Found implementation of procedure strlen_rec [2018-02-04 17:37:48,088 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:37:48,088 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:37:48,089 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:37:48,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:37:48,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:37:48,089 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:37:48,089 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:37:48,089 INFO L128 BoogieDeclarations]: Found specification of procedure strlen_rec [2018-02-04 17:37:48,089 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:37:48,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:37:48,090 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:37:48,202 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:37:48,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:37:48 BoogieIcfgContainer [2018-02-04 17:37:48,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:37:48,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:37:48,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:37:48,206 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:37:48,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:37:47" (1/3) ... [2018-02-04 17:37:48,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0e49b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:37:48, skipping insertion in model container [2018-02-04 17:37:48,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:37:48" (2/3) ... [2018-02-04 17:37:48,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0e49b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:37:48, skipping insertion in model container [2018-02-04 17:37:48,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:37:48" (3/3) ... [2018-02-04 17:37:48,208 INFO L107 eAbstractionObserver]: Analyzing ICFG rec_strlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:37:48,213 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:37:48,218 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 17:37:48,242 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:37:48,243 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:37:48,243 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:37:48,243 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:37:48,243 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:37:48,243 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:37:48,243 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:37:48,243 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:37:48,244 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:37:48,252 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-04 17:37:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:37:48,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:48,259 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:48,260 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 17:37:48,262 INFO L82 PathProgramCache]: Analyzing trace with hash -407257815, now seen corresponding path program 1 times [2018-02-04 17:37:48,264 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:48,264 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:48,294 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,295 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:48,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:48,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:48,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:48,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:37:48,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:37:48,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:37:48,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:37:48,484 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-02-04 17:37:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:48,543 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-02-04 17:37:48,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:37:48,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 17:37:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:48,551 INFO L225 Difference]: With dead ends: 29 [2018-02-04 17:37:48,551 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 17:37:48,592 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:37:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 17:37:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 17:37:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 17:37:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-02-04 17:37:48,616 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-02-04 17:37:48,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:48,616 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-02-04 17:37:48,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:37:48,616 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-02-04 17:37:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:37:48,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:48,617 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:48,617 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 17:37:48,617 INFO L82 PathProgramCache]: Analyzing trace with hash -407257816, now seen corresponding path program 1 times [2018-02-04 17:37:48,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:48,617 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:48,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:48,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:48,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:48,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:48,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:37:48,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:37:48,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:37:48,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:37:48,660 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2018-02-04 17:37:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:48,708 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-02-04 17:37:48,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:37:48,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 17:37:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:48,709 INFO L225 Difference]: With dead ends: 25 [2018-02-04 17:37:48,709 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 17:37:48,710 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:37:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 17:37:48,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 17:37:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 17:37:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-02-04 17:37:48,714 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10 [2018-02-04 17:37:48,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:48,714 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-02-04 17:37:48,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:37:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-02-04 17:37:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:37:48,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:48,715 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:48,715 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 17:37:48,715 INFO L82 PathProgramCache]: Analyzing trace with hash 665022209, now seen corresponding path program 1 times [2018-02-04 17:37:48,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:48,715 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:48,716 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,717 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:48,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:48,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:48,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:48,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:37:48,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:37:48,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:37:48,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:37:48,763 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-02-04 17:37:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:48,795 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-02-04 17:37:48,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:37:48,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-04 17:37:48,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:48,796 INFO L225 Difference]: With dead ends: 24 [2018-02-04 17:37:48,796 INFO L226 Difference]: Without dead ends: 24 [2018-02-04 17:37:48,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:37:48,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-04 17:37:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-04 17:37:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-04 17:37:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-02-04 17:37:48,800 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2018-02-04 17:37:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:48,800 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-02-04 17:37:48,800 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:37:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-02-04 17:37:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 17:37:48,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:48,801 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:48,801 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 17:37:48,801 INFO L82 PathProgramCache]: Analyzing trace with hash 665022210, now seen corresponding path program 1 times [2018-02-04 17:37:48,801 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:48,801 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:48,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,802 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:48,802 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:48,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:48,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:48,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:37:48,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:37:48,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:37:48,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:37:48,893 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 8 states. [2018-02-04 17:37:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:48,948 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-02-04 17:37:48,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:37:48,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-02-04 17:37:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:48,949 INFO L225 Difference]: With dead ends: 31 [2018-02-04 17:37:48,949 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 17:37:48,950 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:37:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 17:37:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 17:37:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 17:37:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-04 17:37:48,954 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 13 [2018-02-04 17:37:48,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:48,954 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-04 17:37:48,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:37:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-04 17:37:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:37:48,955 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:48,955 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:48,955 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 17:37:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1167971539, now seen corresponding path program 1 times [2018-02-04 17:37:48,955 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:48,955 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:48,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:48,956 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:48,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:49,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:49,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:37:49,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:37:49,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:37:49,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:37:49,046 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 9 states. [2018-02-04 17:37:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:49,135 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-02-04 17:37:49,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:37:49,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-04 17:37:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:49,136 INFO L225 Difference]: With dead ends: 45 [2018-02-04 17:37:49,136 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:37:49,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:37:49,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:37:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-02-04 17:37:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 17:37:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-02-04 17:37:49,142 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 17 [2018-02-04 17:37:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:49,142 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-02-04 17:37:49,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:37:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-02-04 17:37:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:37:49,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:49,143 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:49,143 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 17:37:49,143 INFO L82 PathProgramCache]: Analyzing trace with hash -466906961, now seen corresponding path program 1 times [2018-02-04 17:37:49,143 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:49,144 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:49,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:49,145 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:49,145 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:49,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:49,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:49,304 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:49,304 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:49,305 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:49,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:49,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:37:49,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:49,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:49,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:37:49,403 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 16 treesize of output 13 [2018-02-04 17:37:49,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:37:49,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:49,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:49,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:49,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:37:49,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 17:37:49,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 17:37:49,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:49,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:49,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:49,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:37:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:49,624 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:49,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-02-04 17:37:49,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:37:49,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:37:49,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:37:49,625 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 20 states. [2018-02-04 17:37:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:49,898 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 17:37:49,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:37:49,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 17 [2018-02-04 17:37:49,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:49,900 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:37:49,900 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 17:37:49,901 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-02-04 17:37:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 17:37:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-02-04 17:37:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 17:37:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-04 17:37:49,904 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 17 [2018-02-04 17:37:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:49,904 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-04 17:37:49,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:37:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-04 17:37:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 17:37:49,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:49,904 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:49,904 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 17:37:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash -847794598, now seen corresponding path program 2 times [2018-02-04 17:37:49,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:49,905 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:49,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:49,905 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:49,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:49,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:50,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:50,136 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:50,137 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:37:50,167 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:37:50,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:50,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:50,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:37:50,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:37:50,183 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 16 treesize of output 13 [2018-02-04 17:37:50,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:37:50,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:37:50,253 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 19 treesize of output 15 [2018-02-04 17:37:50,258 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 15 treesize of output 12 [2018-02-04 17:37:50,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:50,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:50,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:50,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-02-04 17:37:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:50,330 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:50,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 17:37:50,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:37:50,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:37:50,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:37:50,331 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 22 states. [2018-02-04 17:37:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:50,599 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-02-04 17:37:50,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:37:50,600 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-02-04 17:37:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:50,600 INFO L225 Difference]: With dead ends: 56 [2018-02-04 17:37:50,600 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 17:37:50,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-02-04 17:37:50,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 17:37:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-02-04 17:37:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 17:37:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 17:37:50,604 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 21 [2018-02-04 17:37:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:50,604 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 17:37:50,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:37:50,604 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 17:37:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 17:37:50,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:50,605 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-04 17:37:50,605 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 17:37:50,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1711563014, now seen corresponding path program 1 times [2018-02-04 17:37:50,605 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:50,605 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:50,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:50,606 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:37:50,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:50,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:50,618 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:37:50,618 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:50,618 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:50,619 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:50,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:50,639 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:37:50,641 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 5 [2018-02-04 17:37:50,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:37:50,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:37:50,652 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |main_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |main_#t~malloc3.base| 0)))) is different from true [2018-02-04 17:37:50,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:50,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:37:50,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:37:50,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:37:50,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:37:50,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:37:50,655 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-04 17:37:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:50,691 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-04 17:37:50,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:37:50,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 17:37:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:50,692 INFO L225 Difference]: With dead ends: 53 [2018-02-04 17:37:50,692 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 17:37:50,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2018-02-04 17:37:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 17:37:50,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-02-04 17:37:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 17:37:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-02-04 17:37:50,694 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-02-04 17:37:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:50,695 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-02-04 17:37:50,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:37:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-02-04 17:37:50,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 17:37:50,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:37:50,695 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:37:50,696 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, strlen_recErr1RequiresViolation, strlen_recErr0RequiresViolation]=== [2018-02-04 17:37:50,696 INFO L82 PathProgramCache]: Analyzing trace with hash -757662075, now seen corresponding path program 3 times [2018-02-04 17:37:50,696 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:37:50,696 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:37:50,696 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:50,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:37:50,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:37:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:37:50,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:37:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 17:37:50,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:37:50,795 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:37:50,796 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:37:50,815 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:37:50,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:37:50,817 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:37:50,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:37:50,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:37:50,852 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 16 treesize of output 13 [2018-02-04 17:37:50,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 17:37:50,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:37:50,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:37:50,927 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 19 treesize of output 15 [2018-02-04 17:37:50,932 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 15 treesize of output 12 [2018-02-04 17:37:50,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:37:50,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:50,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:37:50,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2018-02-04 17:37:50,988 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:37:50,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:37:50,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 21 [2018-02-04 17:37:50,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 17:37:50,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 17:37:50,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-02-04 17:37:50,989 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 22 states. [2018-02-04 17:37:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:37:51,433 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-04 17:37:51,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 17:37:51,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-02-04 17:37:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:37:51,433 INFO L225 Difference]: With dead ends: 31 [2018-02-04 17:37:51,434 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:37:51,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=1517, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:37:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:37:51,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:37:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:37:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:37:51,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-02-04 17:37:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:37:51,435 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:37:51,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 17:37:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:37:51,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:37:51,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:37:51 BoogieIcfgContainer [2018-02-04 17:37:51,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:37:51,440 INFO L168 Benchmark]: Toolchain (without parser) took 3585.23 ms. Allocated memory was 393.2 MB in the beginning and 669.5 MB in the end (delta: 276.3 MB). Free memory was 351.4 MB in the beginning and 584.5 MB in the end (delta: -233.1 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:37:51,442 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 393.2 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:37:51,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.81 ms. Allocated memory is still 393.2 MB. Free memory was 350.1 MB in the beginning and 340.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:37:51,442 INFO L168 Benchmark]: Boogie Preprocessor took 28.93 ms. Allocated memory is still 393.2 MB. Free memory was 340.8 MB in the beginning and 338.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:37:51,442 INFO L168 Benchmark]: RCFGBuilder took 160.66 ms. Allocated memory is still 393.2 MB. Free memory was 338.2 MB in the beginning and 324.0 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:37:51,443 INFO L168 Benchmark]: TraceAbstraction took 3236.69 ms. Allocated memory was 393.2 MB in the beginning and 669.5 MB in the end (delta: 276.3 MB). Free memory was 324.0 MB in the beginning and 584.5 MB in the end (delta: -260.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:37:51,444 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.19 ms. Allocated memory is still 393.2 MB. Free memory is still 356.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.81 ms. Allocated memory is still 393.2 MB. Free memory was 350.1 MB in the beginning and 340.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.93 ms. Allocated memory is still 393.2 MB. Free memory was 340.8 MB in the beginning and 338.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 160.66 ms. Allocated memory is still 393.2 MB. Free memory was 338.2 MB in the beginning and 324.0 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3236.69 ms. Allocated memory was 393.2 MB in the beginning and 669.5 MB in the end (delta: 276.3 MB). Free memory was 324.0 MB in the beginning and 584.5 MB in the end (delta: -260.4 MB). Peak memory consumption was 15.9 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: 546]: 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 - 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 - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 5 error locations. SAFE Result, 3.2s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 194 SDtfs, 259 SDslu, 844 SDs, 0 SdLazy, 937 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 52 SyntacticMatches, 8 SemanticMatches, 132 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=7, 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, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 197 ConstructedInterpolants, 9 QuantifiedInterpolants, 30489 SizeOfPredicates, 31 NumberOfNonLiveVariables, 357 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 8/58 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/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-37-51-450.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/rec_strlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-37-51-450.csv Received shutdown request...