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/cstrlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:59:15,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:59:15,895 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:59:15,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:59:15,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:59:15,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:59:15,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:59:15,911 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:59:15,913 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:59:15,914 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:59:15,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:59:15,915 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:59:15,916 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:59:15,917 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:59:15,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:59:15,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:59:15,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:59:15,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:59:15,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:59:15,925 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:59:15,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:59:15,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:59:15,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:59:15,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:59:15,929 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:59:15,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:59:15,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:59:15,931 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:59:15,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:59:15,931 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:59:15,932 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:59:15,932 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-02 20:59:15,943 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:59:15,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:59:15,944 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:59:15,944 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:59:15,944 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:59:15,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:59:15,945 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:59:15,945 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:59:15,945 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:59:15,945 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:59:15,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:59:15,945 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:59:15,945 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:59:15,945 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:59:15,946 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:59:15,946 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:59:15,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:59:15,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:59:15,946 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:59:15,946 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:59:15,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:59:15,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:59:15,947 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 20:59:15,947 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 20:59:15,947 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 20:59:15,972 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:59:15,980 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:59:15,983 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:59:15,984 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:59:15,985 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:59:15,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 20:59:16,111 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:59:16,112 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:59:16,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:59:16,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:59:16,118 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:59:16,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:59:16" (1/1) ... [2018-02-02 20:59:16,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4631af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16, skipping insertion in model container [2018-02-02 20:59:16,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:59:16" (1/1) ... [2018-02-02 20:59:16,132 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:59:16,160 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:59:16,245 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:59:16,257 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:59:16,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16 WrapperNode [2018-02-02 20:59:16,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:59:16,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:59:16,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:59:16,261 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:59:16,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16" (1/1) ... [2018-02-02 20:59:16,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16" (1/1) ... [2018-02-02 20:59:16,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16" (1/1) ... [2018-02-02 20:59:16,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16" (1/1) ... [2018-02-02 20:59:16,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16" (1/1) ... [2018-02-02 20:59:16,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16" (1/1) ... [2018-02-02 20:59:16,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16" (1/1) ... [2018-02-02 20:59:16,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:59:16,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:59:16,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:59:16,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:59:16,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:59:16,331 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:59:16,332 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:59:16,332 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-02 20:59:16,332 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:59:16,332 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:59:16,332 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:59:16,332 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:59:16,332 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:59:16,332 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:59:16,332 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:59:16,332 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-02 20:59:16,332 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:59:16,332 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:59:16,333 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:59:16,446 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:59:16,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:59:16 BoogieIcfgContainer [2018-02-02 20:59:16,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:59:16,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:59:16,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:59:16,449 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:59:16,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:59:16" (1/3) ... [2018-02-02 20:59:16,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585678ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:59:16, skipping insertion in model container [2018-02-02 20:59:16,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:16" (2/3) ... [2018-02-02 20:59:16,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585678ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:59:16, skipping insertion in model container [2018-02-02 20:59:16,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:59:16" (3/3) ... [2018-02-02 20:59:16,451 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 20:59:16,457 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:59:16,461 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 20:59:16,485 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:59:16,486 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:59:16,486 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 20:59:16,486 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 20:59:16,486 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:59:16,486 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:59:16,486 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:59:16,486 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:59:16,487 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:59:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-02 20:59:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:59:16,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:16,500 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:16,500 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:16,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861299, now seen corresponding path program 1 times [2018-02-02 20:59:16,504 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:16,505 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:16,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:16,561 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:16,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:16,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:16,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:16,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:59:16,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:59:16,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:59:16,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:59:16,706 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-02-02 20:59:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:16,760 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-02 20:59:16,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:59:16,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 20:59:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:16,767 INFO L225 Difference]: With dead ends: 29 [2018-02-02 20:59:16,767 INFO L226 Difference]: Without dead ends: 26 [2018-02-02 20:59:16,769 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:16,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-02 20:59:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-02 20:59:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-02 20:59:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-02 20:59:16,834 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 10 [2018-02-02 20:59:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:16,835 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-02 20:59:16,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:59:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-02 20:59:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 20:59:16,835 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:16,835 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:16,835 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1072861300, now seen corresponding path program 1 times [2018-02-02 20:59:16,836 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:16,836 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:16,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:16,837 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:16,837 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:16,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:16,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:16,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:59:16,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:59:16,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:59:16,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:16,924 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 5 states. [2018-02-02 20:59:16,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:16,970 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-02-02 20:59:16,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:59:16,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 20:59:16,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:16,972 INFO L225 Difference]: With dead ends: 25 [2018-02-02 20:59:16,972 INFO L226 Difference]: Without dead ends: 25 [2018-02-02 20:59:16,973 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:59:16,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-02 20:59:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-02 20:59:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-02 20:59:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-02 20:59:16,975 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 10 [2018-02-02 20:59:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:16,976 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-02 20:59:16,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:59:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-02 20:59:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:59:16,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:16,976 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:16,977 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:16,977 INFO L82 PathProgramCache]: Analyzing trace with hash -360318775, now seen corresponding path program 1 times [2018-02-02 20:59:16,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:16,977 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:16,978 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:16,978 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:16,978 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:16,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:17,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:17,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:59:17,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:59:17,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:59:17,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:17,019 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2018-02-02 20:59:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:17,065 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-02-02 20:59:17,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:59:17,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 20:59:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:17,066 INFO L225 Difference]: With dead ends: 24 [2018-02-02 20:59:17,066 INFO L226 Difference]: Without dead ends: 24 [2018-02-02 20:59:17,066 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-02 20:59:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-02-02 20:59:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-02-02 20:59:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-02-02 20:59:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-02-02 20:59:17,069 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2018-02-02 20:59:17,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:17,069 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-02-02 20:59:17,070 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:59:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-02-02 20:59:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 20:59:17,070 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:17,070 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:17,070 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash -360318774, now seen corresponding path program 1 times [2018-02-02 20:59:17,071 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:17,071 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:17,071 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:17,072 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:17,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:17,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:17,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:17,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:59:17,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:59:17,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:59:17,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:59:17,168 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-02-02 20:59:17,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:17,234 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-02-02 20:59:17,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:59:17,235 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-02-02 20:59:17,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:17,237 INFO L225 Difference]: With dead ends: 30 [2018-02-02 20:59:17,238 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 20:59:17,238 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-02 20:59:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 20:59:17,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-02-02 20:59:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-02 20:59:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-02 20:59:17,241 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 14 [2018-02-02 20:59:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:17,242 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-02 20:59:17,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:59:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-02 20:59:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:59:17,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:17,242 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:17,243 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1133368501, now seen corresponding path program 1 times [2018-02-02 20:59:17,243 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:17,243 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:17,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:17,244 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:17,244 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:17,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:17,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:17,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:59:17,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:59:17,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:59:17,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:59:17,356 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2018-02-02 20:59:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:17,454 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-02-02 20:59:17,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:59:17,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-02-02 20:59:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:17,455 INFO L225 Difference]: With dead ends: 42 [2018-02-02 20:59:17,455 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 20:59:17,456 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-02 20:59:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 20:59:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-02-02 20:59:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 20:59:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-02-02 20:59:17,459 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 17 [2018-02-02 20:59:17,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:17,459 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-02-02 20:59:17,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:59:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-02-02 20:59:17,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 20:59:17,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:17,460 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:17,460 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:17,460 INFO L82 PathProgramCache]: Analyzing trace with hash -432303923, now seen corresponding path program 1 times [2018-02-02 20:59:17,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:17,460 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:17,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:17,461 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:17,462 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:17,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:17,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:17,625 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:17,626 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:17,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:17,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 20:59:17,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:17,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:17,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 20:59:17,725 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-02 20:59:17,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 20:59:17,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:17,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:17,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:17,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-02 20:59:17,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-02 20:59:17,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 20:59:17,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 20:59:17,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 20:59:17,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 20:59:17,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-02 20:59:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:17,873 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 20:59:17,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-02-02 20:59:17,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:59:17,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:59:17,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:59:17,874 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-02-02 20:59:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:18,168 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-02-02 20:59:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:59:18,168 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-02-02 20:59:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:18,169 INFO L225 Difference]: With dead ends: 47 [2018-02-02 20:59:18,169 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 20:59:18,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:59:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 20:59:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2018-02-02 20:59:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 20:59:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-02-02 20:59:18,173 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 17 [2018-02-02 20:59:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:18,173 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-02-02 20:59:18,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:59:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-02-02 20:59:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:59:18,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:18,173 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:18,173 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:18,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1840705640, now seen corresponding path program 2 times [2018-02-02 20:59:18,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:18,174 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:18,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:18,174 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:18,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:18,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:18,391 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:18,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:18,392 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 20:59:18,409 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 20:59:18,409 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 20:59:18,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:18,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 20:59:18,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:18,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:18,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 20:59:18,423 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-02 20:59:18,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 20:59:18,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:18,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:18,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:18,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 20:59:18,481 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-02 20:59:18,486 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-02 20:59:18,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 20:59:18,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 20:59:18,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 20:59:18,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:40 [2018-02-02 20:59:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:18,530 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 20:59:18,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-02-02 20:59:18,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 20:59:18,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 20:59:18,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:59:18,530 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 17 states. [2018-02-02 20:59:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:18,770 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-02-02 20:59:18,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:59:18,770 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2018-02-02 20:59:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:18,771 INFO L225 Difference]: With dead ends: 53 [2018-02-02 20:59:18,771 INFO L226 Difference]: Without dead ends: 53 [2018-02-02 20:59:18,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-02-02 20:59:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-02 20:59:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-02-02 20:59:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 20:59:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-02-02 20:59:18,774 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2018-02-02 20:59:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:18,774 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-02-02 20:59:18,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 20:59:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-02-02 20:59:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:59:18,775 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:18,775 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-02 20:59:18,775 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:18,775 INFO L82 PathProgramCache]: Analyzing trace with hash 248709196, now seen corresponding path program 1 times [2018-02-02 20:59:18,775 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:18,775 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:18,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:18,776 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 20:59:18,776 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:18,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:59:18,790 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 20:59:18,793 INFO L168 Benchmark]: Toolchain (without parser) took 2681.79 ms. Allocated memory was 399.5 MB in the beginning and 671.1 MB in the end (delta: 271.6 MB). Free memory was 357.7 MB in the beginning and 638.0 MB in the end (delta: -280.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:59:18,794 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:59:18,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.37 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 347.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:18,795 INFO L168 Benchmark]: Boogie Preprocessor took 29.04 ms. Allocated memory is still 399.5 MB. Free memory was 347.1 MB in the beginning and 344.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:18,795 INFO L168 Benchmark]: RCFGBuilder took 156.55 ms. Allocated memory is still 399.5 MB. Free memory was 344.5 MB in the beginning and 330.2 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:18,795 INFO L168 Benchmark]: TraceAbstraction took 2344.98 ms. Allocated memory was 399.5 MB in the beginning and 671.1 MB in the end (delta: 271.6 MB). Free memory was 330.2 MB in the beginning and 638.0 MB in the end (delta: -307.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:59:18,796 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.12 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.37 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 347.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.04 ms. Allocated memory is still 399.5 MB. Free memory was 347.1 MB in the beginning and 344.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 156.55 ms. Allocated memory is still 399.5 MB. Free memory was 344.5 MB in the beginning and 330.2 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2344.98 ms. Allocated memory was 399.5 MB in the beginning and 671.1 MB in the end (delta: 271.6 MB). Free memory was 330.2 MB in the beginning and 638.0 MB in the end (delta: -307.9 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-59-18-801.csv Received shutdown request...