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_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:59:52,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:59:52,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:59:52,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:59:52,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:59:52,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:59:52,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:59:52,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:59:52,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:59:52,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:59:52,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:59:52,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:59:52,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:59:52,600 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:59:52,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:59:52,602 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:59:52,604 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:59:52,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:59:52,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:59:52,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:59:52,609 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:59:52,609 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:59:52,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:59:52,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:59:52,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:59:52,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:59:52,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:59:52,612 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:59:52,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:59:52,613 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:59:52,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:59:52,613 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:52,622 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:59:52,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:59:52,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:59:52,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:59:52,624 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:59:52,624 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:59:52,624 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:59:52,624 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:59:52,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:59:52,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:59:52,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:59:52,624 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:59:52,624 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:59:52,625 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:59:52,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:59:52,625 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:59:52,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:59:52,625 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:59:52,625 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:59:52,625 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:59:52,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:59:52,625 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:59:52,625 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 20:59:52,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 20:59:52,626 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-02 20:59:52,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:59:52,662 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:59:52,665 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:59:52,666 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:59:52,666 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:59:52,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 20:59:52,779 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:59:52,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:59:52,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:59:52,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:59:52,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:59:52,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:59:52" (1/1) ... [2018-02-02 20:59:52,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5822695f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:52, skipping insertion in model container [2018-02-02 20:59:52,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:59:52" (1/1) ... [2018-02-02 20:59:52,797 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:59:52,823 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:59:52,907 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:59:52,918 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:59:52,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:52 WrapperNode [2018-02-02 20:59:52,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:59:52,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:59:52,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:59:52,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:59:52,936 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:52" (1/1) ... [2018-02-02 20:59:52,936 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:52" (1/1) ... [2018-02-02 20:59:52,944 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:52" (1/1) ... [2018-02-02 20:59:52,944 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:52" (1/1) ... [2018-02-02 20:59:52,946 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:52" (1/1) ... [2018-02-02 20:59:52,948 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:52" (1/1) ... [2018-02-02 20:59:52,949 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:52" (1/1) ... [2018-02-02 20:59:52,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:59:52,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:59:52,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:59:52,950 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:59:52,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:52" (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:52,988 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:59:52,988 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:59:52,988 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-02-02 20:59:52,988 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:59:52,989 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:59:52,989 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:59:52,989 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:59:52,989 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:59:52,989 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:59:52,989 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:59:52,989 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-02-02 20:59:52,989 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:59:52,989 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:59:52,990 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:59:53,123 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:59:53,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:59:53 BoogieIcfgContainer [2018-02-02 20:59:53,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:59:53,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:59:53,125 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:59:53,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:59:53,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:59:52" (1/3) ... [2018-02-02 20:59:53,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf39d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:59:53, skipping insertion in model container [2018-02-02 20:59:53,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:59:52" (2/3) ... [2018-02-02 20:59:53,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf39d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:59:53, skipping insertion in model container [2018-02-02 20:59:53,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:59:53" (3/3) ... [2018-02-02 20:59:53,129 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-02-02 20:59:53,134 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:59:53,139 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 20:59:53,161 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:59:53,161 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:59:53,161 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 20:59:53,161 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 20:59:53,161 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:59:53,161 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:59:53,162 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:59:53,162 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:59:53,162 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:59:53,171 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-02-02 20:59:53,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 20:59:53,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:53,178 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:53,178 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130590, now seen corresponding path program 1 times [2018-02-02 20:59:53,183 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:53,183 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:53,212 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:53,212 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:53,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:53,251 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:53,324 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:53,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:53,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:59:53,328 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:59:53,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:59:53,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:59:53,344 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2018-02-02 20:59:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:53,407 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-02 20:59:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:59:53,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-02 20:59:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:53,456 INFO L225 Difference]: With dead ends: 33 [2018-02-02 20:59:53,456 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 20:59:53,459 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:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 20:59:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 20:59:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 20:59:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-02-02 20:59:53,483 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-02-02 20:59:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:53,483 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-02-02 20:59:53,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:59:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-02-02 20:59:53,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 20:59:53,484 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:53,484 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:53,484 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:53,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2082130589, now seen corresponding path program 1 times [2018-02-02 20:59:53,484 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:53,484 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:53,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:53,485 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:53,485 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:53,500 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:53,593 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:53,593 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:53,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:59:53,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:59:53,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:59:53,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:53,595 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 5 states. [2018-02-02 20:59:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:53,640 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-02-02 20:59:53,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:59:53,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-02 20:59:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:53,641 INFO L225 Difference]: With dead ends: 29 [2018-02-02 20:59:53,642 INFO L226 Difference]: Without dead ends: 29 [2018-02-02 20:59:53,642 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:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-02 20:59:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-02 20:59:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 20:59:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-02-02 20:59:53,646 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2018-02-02 20:59:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:53,646 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-02-02 20:59:53,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:59:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-02-02 20:59:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 20:59:53,647 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:53,647 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:53,647 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:53,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870561, now seen corresponding path program 1 times [2018-02-02 20:59:53,648 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:53,648 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:53,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:53,649 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:53,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:53,663 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:53,708 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:53,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:53,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:59:53,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:59:53,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:59:53,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:59:53,710 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 5 states. [2018-02-02 20:59:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:53,771 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-02-02 20:59:53,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:59:53,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-02 20:59:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:53,772 INFO L225 Difference]: With dead ends: 28 [2018-02-02 20:59:53,772 INFO L226 Difference]: Without dead ends: 28 [2018-02-02 20:59:53,773 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:53,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-02 20:59:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-02 20:59:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 20:59:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-02 20:59:53,776 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-02 20:59:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:53,776 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-02 20:59:53,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:59:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-02 20:59:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 20:59:53,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:53,777 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:53,777 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1021870562, now seen corresponding path program 1 times [2018-02-02 20:59:53,777 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:53,778 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:53,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:53,779 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:53,779 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:53,792 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:53,868 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:53,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:53,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:59:53,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:59:53,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:59:53,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:59:53,869 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-02-02 20:59:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:53,950 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-02-02 20:59:53,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:59:53,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-02 20:59:53,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:53,954 INFO L225 Difference]: With dead ends: 37 [2018-02-02 20:59:53,954 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 20:59:53,954 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:53,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 20:59:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-02-02 20:59:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 20:59:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-02-02 20:59:53,958 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-02-02 20:59:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:53,959 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-02-02 20:59:53,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:59:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-02-02 20:59:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 20:59:53,960 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:53,960 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:53,960 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1174981545, now seen corresponding path program 1 times [2018-02-02 20:59:53,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:53,960 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:53,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:53,961 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:53,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:53,973 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:53,988 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:53,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:53,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 20:59:53,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:59:53,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:59:53,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:59:53,989 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-02-02 20:59:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:53,998 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-02-02 20:59:53,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:59:53,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-02 20:59:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:53,999 INFO L225 Difference]: With dead ends: 32 [2018-02-02 20:59:53,999 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 20:59:53,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:59:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 20:59:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-02 20:59:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 20:59:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-02-02 20:59:54,002 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-02-02 20:59:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:54,003 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-02-02 20:59:54,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:59:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-02-02 20:59:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:59:54,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:54,003 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:54,004 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1402540986, now seen corresponding path program 1 times [2018-02-02 20:59:54,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:54,004 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:54,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:54,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:54,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:54,021 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:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:54,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:54,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:54,091 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:54,117 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:54,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 20:59:54,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-02 20:59:54,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:59:54,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:59:54,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:59:54,164 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 8 states. [2018-02-02 20:59:54,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:54,253 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-02-02 20:59:54,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:59:54,254 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 20:59:54,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:54,255 INFO L225 Difference]: With dead ends: 58 [2018-02-02 20:59:54,255 INFO L226 Difference]: Without dead ends: 58 [2018-02-02 20:59:54,255 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:59:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-02 20:59:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-02-02 20:59:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 20:59:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2018-02-02 20:59:54,260 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 22 [2018-02-02 20:59:54,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:54,260 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2018-02-02 20:59:54,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:59:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-02-02 20:59:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:59:54,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:54,261 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:54,261 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:54,262 INFO L82 PathProgramCache]: Analyzing trace with hash 122677308, now seen corresponding path program 1 times [2018-02-02 20:59:54,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:54,262 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:54,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:54,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:54,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:54,276 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:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:54,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:54,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:59:54,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:59:54,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:59:54,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:59:54,363 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 10 states. [2018-02-02 20:59:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:54,476 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-02-02 20:59:54,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:59:54,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 20:59:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:54,477 INFO L225 Difference]: With dead ends: 83 [2018-02-02 20:59:54,477 INFO L226 Difference]: Without dead ends: 83 [2018-02-02 20:59:54,478 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:59:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-02 20:59:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 63. [2018-02-02 20:59:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-02 20:59:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-02-02 20:59:54,483 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 22 [2018-02-02 20:59:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:54,483 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-02-02 20:59:54,483 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:59:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-02-02 20:59:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 20:59:54,483 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:54,483 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:54,484 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash -898391046, now seen corresponding path program 1 times [2018-02-02 20:59:54,484 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:54,484 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:54,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:54,484 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:54,484 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:54,496 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:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:54,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 20:59:54,668 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-02 20:59:54,668 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:54,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 20:59:54,711 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:54,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:54,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:54,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 20:59:54,751 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:54,753 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:54,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 20:59:54,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:54,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 20:59:54,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-02-02 20:59:54,818 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:54,826 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:54,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 20:59:54,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 20:59:54,842 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:54,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-02 20:59:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:59:54,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 20:59:54,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-02-02 20:59:54,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:59:54,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:59:54,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:59:54,942 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 20 states. [2018-02-02 20:59:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:55,394 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2018-02-02 20:59:55,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:59:55,394 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2018-02-02 20:59:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:55,395 INFO L225 Difference]: With dead ends: 85 [2018-02-02 20:59:55,395 INFO L226 Difference]: Without dead ends: 85 [2018-02-02 20:59:55,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:59:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-02 20:59:55,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2018-02-02 20:59:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-02 20:59:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-02-02 20:59:55,401 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2018-02-02 20:59:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:55,401 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-02-02 20:59:55,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:59:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-02-02 20:59:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:59:55,402 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:55,402 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:55,402 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:55,402 INFO L82 PathProgramCache]: Analyzing trace with hash 851727292, now seen corresponding path program 1 times [2018-02-02 20:59:55,402 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:55,402 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:55,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:55,403 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:55,403 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:55,412 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:55,473 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:55,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:59:55,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:59:55,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:59:55,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:59:55,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:59:55,474 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 6 states. [2018-02-02 20:59:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:59:55,528 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2018-02-02 20:59:55,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:59:55,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 20:59:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:59:55,529 INFO L225 Difference]: With dead ends: 96 [2018-02-02 20:59:55,529 INFO L226 Difference]: Without dead ends: 92 [2018-02-02 20:59:55,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:59:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-02 20:59:55,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2018-02-02 20:59:55,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-02 20:59:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-02-02 20:59:55,542 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 23 [2018-02-02 20:59:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:59:55,543 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-02-02 20:59:55,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:59:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-02-02 20:59:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:59:55,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:59:55,545 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:59:55,547 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrnlenErr0RequiresViolation, cstrnlenErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 20:59:55,547 INFO L82 PathProgramCache]: Analyzing trace with hash -169341062, now seen corresponding path program 1 times [2018-02-02 20:59:55,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-02 20:59:55,547 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-02 20:59:55,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:55,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 20:59:55,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 20:59:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:59:55,557 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:55,560 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:55,563 INFO L168 Benchmark]: Toolchain (without parser) took 2784.51 ms. Allocated memory was 396.4 MB in the beginning and 673.7 MB in the end (delta: 277.3 MB). Free memory was 353.2 MB in the beginning and 643.5 MB in the end (delta: -290.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:59:55,564 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 396.4 MB. Free memory is still 358.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:59:55,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.90 ms. Allocated memory is still 396.4 MB. Free memory was 353.2 MB in the beginning and 342.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:55,565 INFO L168 Benchmark]: Boogie Preprocessor took 26.61 ms. Allocated memory is still 396.4 MB. Free memory was 342.7 MB in the beginning and 340.0 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:55,565 INFO L168 Benchmark]: RCFGBuilder took 174.13 ms. Allocated memory is still 396.4 MB. Free memory was 340.0 MB in the beginning and 323.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:59:55,565 INFO L168 Benchmark]: TraceAbstraction took 2438.41 ms. Allocated memory was 396.4 MB in the beginning and 673.7 MB in the end (delta: 277.3 MB). Free memory was 323.3 MB in the beginning and 643.5 MB in the end (delta: -320.1 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:59:55,566 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.10 ms. Allocated memory is still 396.4 MB. Free memory is still 358.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 142.90 ms. Allocated memory is still 396.4 MB. Free memory was 353.2 MB in the beginning and 342.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.61 ms. Allocated memory is still 396.4 MB. Free memory was 342.7 MB in the beginning and 340.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 174.13 ms. Allocated memory is still 396.4 MB. Free memory was 340.0 MB in the beginning and 323.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2438.41 ms. Allocated memory was 396.4 MB in the beginning and 673.7 MB in the end (delta: 277.3 MB). Free memory was 323.3 MB in the beginning and 643.5 MB in the end (delta: -320.1 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/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-59-55-571.csv Received shutdown request...