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/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:32:44,117 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:32:44,118 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:32:44,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:32:44,130 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:32:44,130 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:32:44,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:32:44,133 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:32:44,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:32:44,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:32:44,136 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:32:44,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:32:44,136 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:32:44,137 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:32:44,138 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:32:44,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:32:44,141 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:32:44,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:32:44,143 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:32:44,144 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:32:44,146 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:32:44,146 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:32:44,146 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:32:44,147 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:32:44,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:32:44,149 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:32:44,149 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:32:44,149 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:32:44,149 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:32:44,150 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:32:44,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:32:44,150 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:32:44,159 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:32:44,159 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:32:44,160 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:32:44,160 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:32:44,160 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:32:44,160 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:32:44,160 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:32:44,160 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:32:44,160 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:32:44,160 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:32:44,161 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:32:44,161 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:32:44,161 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:32:44,161 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:32:44,161 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:32:44,161 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:32:44,161 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:32:44,161 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:32:44,161 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:32:44,161 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:32:44,162 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:32:44,162 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:32:44,162 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:32:44,162 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:32:44,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:32:44,199 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:32:44,202 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:32:44,203 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:32:44,204 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:32:44,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:32:44,333 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:32:44,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:32:44,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:32:44,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:32:44,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:32:44,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:32:44" (1/1) ... [2018-02-04 17:32:44,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db90158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44, skipping insertion in model container [2018-02-04 17:32:44,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:32:44" (1/1) ... [2018-02-04 17:32:44,356 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:32:44,383 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:32:44,466 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:32:44,476 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:32:44,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44 WrapperNode [2018-02-04 17:32:44,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:32:44,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:32:44,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:32:44,480 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:32:44,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44" (1/1) ... [2018-02-04 17:32:44,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44" (1/1) ... [2018-02-04 17:32:44,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44" (1/1) ... [2018-02-04 17:32:44,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44" (1/1) ... [2018-02-04 17:32:44,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44" (1/1) ... [2018-02-04 17:32:44,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44" (1/1) ... [2018-02-04 17:32:44,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44" (1/1) ... [2018-02-04 17:32:44,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:32:44,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:32:44,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:32:44,507 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:32:44,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44" (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:32:44,542 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:32:44,542 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:32:44,542 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 17:32:44,542 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:32:44,542 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:32:44,542 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:32:44,543 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:32:44,543 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:32:44,543 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:32:44,543 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:32:44,543 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 17:32:44,543 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:32:44,543 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:32:44,543 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:32:44,641 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:32:44,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:32:44 BoogieIcfgContainer [2018-02-04 17:32:44,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:32:44,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:32:44,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:32:44,644 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:32:44,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:32:44" (1/3) ... [2018-02-04 17:32:44,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264bd39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:32:44, skipping insertion in model container [2018-02-04 17:32:44,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:32:44" (2/3) ... [2018-02-04 17:32:44,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264bd39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:32:44, skipping insertion in model container [2018-02-04 17:32:44,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:32:44" (3/3) ... [2018-02-04 17:32:44,647 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:32:44,653 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:32:44,657 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 17:32:44,687 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:32:44,687 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:32:44,688 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:32:44,688 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:32:44,688 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:32:44,688 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:32:44,688 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:32:44,688 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:32:44,689 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:32:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-04 17:32:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:32:44,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:44,710 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:44,711 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434931, now seen corresponding path program 1 times [2018-02-04 17:32:44,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:44,715 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:44,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:44,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:44,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:44,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:44,846 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:32:44,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:44,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:32:44,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:32:44,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:32:44,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:32:44,860 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-02-04 17:32:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:44,921 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 17:32:44,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:32:44,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 17:32:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:44,928 INFO L225 Difference]: With dead ends: 30 [2018-02-04 17:32:44,929 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 17:32:44,930 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:32:44,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 17:32:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-02-04 17:32:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 17:32:45,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 17:32:45,001 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 10 [2018-02-04 17:32:45,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:45,001 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 17:32:45,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:32:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 17:32:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:32:45,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:45,002 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:45,002 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:45,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1793434932, now seen corresponding path program 1 times [2018-02-04 17:32:45,002 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:45,002 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:45,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:45,003 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:45,003 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:45,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:45,091 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:32:45,091 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:45,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:32:45,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:32:45,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:32:45,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:32:45,093 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-04 17:32:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:45,138 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-02-04 17:32:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:32:45,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 17:32:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:45,139 INFO L225 Difference]: With dead ends: 26 [2018-02-04 17:32:45,139 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 17:32:45,140 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:32:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 17:32:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 17:32:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 17:32:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 17:32:45,143 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-02-04 17:32:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:45,143 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 17:32:45,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:32:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 17:32:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:32:45,144 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:45,144 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:45,144 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900249, now seen corresponding path program 1 times [2018-02-04 17:32:45,144 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:45,144 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:45,145 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:45,145 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:45,146 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:45,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:45,181 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:32:45,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:45,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:32:45,181 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:32:45,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:32:45,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:32:45,182 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-02-04 17:32:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:45,243 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-02-04 17:32:45,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:32:45,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 17:32:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:45,244 INFO L225 Difference]: With dead ends: 25 [2018-02-04 17:32:45,244 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 17:32:45,244 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:32:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 17:32:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 17:32:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 17:32:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 17:32:45,247 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-02-04 17:32:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:45,247 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 17:32:45,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:32:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 17:32:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 17:32:45,248 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:45,248 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:45,248 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:45,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2006900248, now seen corresponding path program 1 times [2018-02-04 17:32:45,248 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:45,248 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:45,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:45,249 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:45,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:45,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:45,335 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:32:45,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:45,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:32:45,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:32:45,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:32:45,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:32:45,336 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 8 states. [2018-02-04 17:32:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:45,426 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 17:32:45,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:32:45,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-02-04 17:32:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:45,432 INFO L225 Difference]: With dead ends: 32 [2018-02-04 17:32:45,432 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 17:32:45,433 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:32:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 17:32:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2018-02-04 17:32:45,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 17:32:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 17:32:45,435 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 14 [2018-02-04 17:32:45,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:45,435 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 17:32:45,435 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:32:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 17:32:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:32:45,436 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:45,436 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:45,436 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:45,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1301829867, now seen corresponding path program 1 times [2018-02-04 17:32:45,436 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:45,436 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:45,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:45,437 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:45,437 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:45,447 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:45,553 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:32:45,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:45,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:32:45,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:32:45,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:32:45,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:32:45,554 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-02-04 17:32:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:45,629 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 17:32:45,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:32:45,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-04 17:32:45,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:45,630 INFO L225 Difference]: With dead ends: 43 [2018-02-04 17:32:45,630 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 17:32:45,630 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:32:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 17:32:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2018-02-04 17:32:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:32:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-02-04 17:32:45,634 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2018-02-04 17:32:45,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:45,635 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-02-04 17:32:45,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:32:45,635 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-02-04 17:32:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:32:45,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:45,636 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:45,636 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:45,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1559995305, now seen corresponding path program 1 times [2018-02-04 17:32:45,636 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:45,636 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:45,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:45,637 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:45,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:45,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:45,756 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:32:45,757 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:45,757 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:45,757 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:45,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:45,825 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:32:45,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:45,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:45,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:32:45,868 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:32:45,869 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:32:45,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:45,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:45,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:45,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-04 17:32:45,955 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:32:45,961 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:32:45,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:45,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:45,974 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:32:45,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:32:46,062 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:32:46,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:32:46,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-02-04 17:32:46,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 17:32:46,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 17:32:46,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-02-04 17:32:46,063 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 18 states. [2018-02-04 17:32:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:46,347 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-02-04 17:32:46,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:32:46,347 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-02-04 17:32:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:46,348 INFO L225 Difference]: With dead ends: 50 [2018-02-04 17:32:46,348 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 17:32:46,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:32:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 17:32:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-02-04 17:32:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 17:32:46,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-02-04 17:32:46,351 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 18 [2018-02-04 17:32:46,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:46,351 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-02-04 17:32:46,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 17:32:46,351 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-02-04 17:32:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:32:46,351 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:46,352 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] [2018-02-04 17:32:46,352 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:46,352 INFO L82 PathProgramCache]: Analyzing trace with hash -968711636, now seen corresponding path program 1 times [2018-02-04 17:32:46,352 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:46,352 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:46,352 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:46,353 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:46,353 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:46,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:46,370 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:32:46,371 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:46,371 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:46,371 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:46,389 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:46,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:32:46,398 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:32:46,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:46,408 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:32:46,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-04 17:32:46,418 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:32:46,423 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:32:46,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:32:46,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:32:46,423 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:32:46,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:32:46,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-02-04 17:32:46,424 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 6 states. [2018-02-04 17:32:46,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:46,449 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-02-04 17:32:46,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:32:46,449 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 17:32:46,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:46,450 INFO L225 Difference]: With dead ends: 41 [2018-02-04 17:32:46,450 INFO L226 Difference]: Without dead ends: 23 [2018-02-04 17:32:46,450 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 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:32:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-04 17:32:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-04 17:32:46,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-04 17:32:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-02-04 17:32:46,451 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 22 [2018-02-04 17:32:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:46,452 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-02-04 17:32:46,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:32:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-02-04 17:32:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:32:46,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:46,452 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:46,452 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:46,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1772753452, now seen corresponding path program 2 times [2018-02-04 17:32:46,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:46,452 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:46,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:46,453 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:32:46,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:46,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:46,609 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:32:46,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:46,609 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:46,609 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:32:46,627 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:32:46,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:46,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:46,636 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:32:46,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:46,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:46,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:32:46,645 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:32:46,646 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:32:46,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:46,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:46,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:46,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 17:32:46,705 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:32:46,709 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:32:46,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:46,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:46,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:46,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:40 [2018-02-04 17:32:46,766 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:32:46,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:32:46,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-02-04 17:32:46,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 17:32:46,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 17:32:46,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:32:46,767 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 19 states. [2018-02-04 17:32:47,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:47,050 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-02-04 17:32:47,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 17:32:47,050 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2018-02-04 17:32:47,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:47,050 INFO L225 Difference]: With dead ends: 29 [2018-02-04 17:32:47,050 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 17:32:47,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-02-04 17:32:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 17:32:47,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-02-04 17:32:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 17:32:47,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-02-04 17:32:47,052 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-02-04 17:32:47,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:47,052 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-02-04 17:32:47,052 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 17:32:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-02-04 17:32:47,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 17:32:47,053 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:32:47,053 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:32:47,053 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-04 17:32:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2069395665, now seen corresponding path program 3 times [2018-02-04 17:32:47,053 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:32:47,053 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:32:47,053 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:47,054 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:32:47,054 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:32:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:32:47,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:32:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:32:47,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:32:47,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:32:47,155 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 17:32:47,178 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 17:32:47,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:32:47,181 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:32:47,188 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:32:47,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:47,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:47,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 17:32:47,196 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 15 treesize of output 12 [2018-02-04 17:32:47,197 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 12 treesize of output 11 [2018-02-04 17:32:47,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:32:47,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:47,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:32:47,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 17:32:47,226 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:32:47,233 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:32:47,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:32:47,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:47,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:32:47,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 17:32:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-04 17:32:47,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:32:47,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2018-02-04 17:32:47,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:32:47,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:32:47,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:32:47,275 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 13 states. [2018-02-04 17:32:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:32:47,396 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-02-04 17:32:47,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 17:32:47,396 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-02-04 17:32:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:32:47,396 INFO L225 Difference]: With dead ends: 26 [2018-02-04 17:32:47,396 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:32:47,397 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2018-02-04 17:32:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:32:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:32:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:32:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:32:47,398 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-02-04 17:32:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:32:47,398 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:32:47,398 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:32:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:32:47,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:32:47,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:32:47 BoogieIcfgContainer [2018-02-04 17:32:47,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:32:47,401 INFO L168 Benchmark]: Toolchain (without parser) took 3067.81 ms. Allocated memory was 401.1 MB in the beginning and 656.4 MB in the end (delta: 255.3 MB). Free memory was 359.3 MB in the beginning and 481.2 MB in the end (delta: -121.9 MB). Peak memory consumption was 133.4 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:47,402 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:32:47,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.81 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 348.7 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:32:47,403 INFO L168 Benchmark]: Boogie Preprocessor took 26.04 ms. Allocated memory is still 401.1 MB. Free memory was 348.7 MB in the beginning and 346.1 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:32:47,403 INFO L168 Benchmark]: RCFGBuilder took 135.30 ms. Allocated memory is still 401.1 MB. Free memory was 346.1 MB in the beginning and 331.9 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:47,403 INFO L168 Benchmark]: TraceAbstraction took 2758.89 ms. Allocated memory was 401.1 MB in the beginning and 656.4 MB in the end (delta: 255.3 MB). Free memory was 330.6 MB in the beginning and 481.2 MB in the end (delta: -150.6 MB). Peak memory consumption was 104.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:32:47,404 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.13 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 144.81 ms. Allocated memory is still 401.1 MB. Free memory was 358.0 MB in the beginning and 348.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.04 ms. Allocated memory is still 401.1 MB. Free memory was 348.7 MB in the beginning and 346.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 135.30 ms. Allocated memory is still 401.1 MB. Free memory was 346.1 MB in the beginning and 331.9 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2758.89 ms. Allocated memory was 401.1 MB in the beginning and 656.4 MB in the end (delta: 255.3 MB). Free memory was 330.6 MB in the beginning and 481.2 MB in the end (delta: -150.6 MB). Peak memory consumption was 104.7 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: 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 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 5 error locations. SAFE Result, 2.7s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 166 SDtfs, 240 SDslu, 607 SDs, 0 SdLazy, 581 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, 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, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 208 ConstructedInterpolants, 12 QuantifiedInterpolants, 34005 SizeOfPredicates, 24 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 14/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/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-32-47-409.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-32-47-409.csv Received shutdown request...