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_cbzero-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:03:32,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:03:32,805 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:03:32,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:03:32,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:03:32,819 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:03:32,820 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:03:32,821 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:03:32,823 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:03:32,824 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:03:32,825 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:03:32,825 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:03:32,826 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:03:32,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:03:32,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:03:32,829 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:03:32,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:03:32,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:03:32,834 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:03:32,835 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:03:32,836 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:03:32,837 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:03:32,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:03:32,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:03:32,838 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:03:32,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:03:32,840 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:03:32,840 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:03:32,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:03:32,841 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:03:32,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:03:32,841 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:03:32,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:03:32,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:03:32,852 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:03:32,852 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:03:32,852 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:03:32,853 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:03:32,853 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:03:32,853 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:03:32,853 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:03:32,853 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:03:32,853 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:03:32,854 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:03:32,854 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:03:32,854 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:03:32,854 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:03:32,854 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:03:32,854 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:03:32,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:03:32,855 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:03:32,855 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:03:32,855 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:03:32,855 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:03:32,855 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:03:32,856 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:03:32,856 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:03:32,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:03:32,892 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:03:32,896 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:03:32,897 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:03:32,897 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:03:32,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-02-04 04:03:33,021 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:03:33,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:03:33,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:03:33,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:03:33,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:03:33,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:03:33" (1/1) ... [2018-02-04 04:03:33,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d4a3d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33, skipping insertion in model container [2018-02-04 04:03:33,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:03:33" (1/1) ... [2018-02-04 04:03:33,044 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:03:33,073 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:03:33,165 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:03:33,175 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:03:33,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33 WrapperNode [2018-02-04 04:03:33,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:03:33,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:03:33,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:03:33,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:03:33,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33" (1/1) ... [2018-02-04 04:03:33,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33" (1/1) ... [2018-02-04 04:03:33,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33" (1/1) ... [2018-02-04 04:03:33,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33" (1/1) ... [2018-02-04 04:03:33,203 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33" (1/1) ... [2018-02-04 04:03:33,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33" (1/1) ... [2018-02-04 04:03:33,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33" (1/1) ... [2018-02-04 04:03:33,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:03:33,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:03:33,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:03:33,208 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:03:33,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:03:33,243 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:03:33,244 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:03:33,244 INFO L136 BoogieDeclarations]: Found implementation of procedure cbzero [2018-02-04 04:03:33,244 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:03:33,244 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 04:03:33,244 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 04:03:33,244 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:03:33,244 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:03:33,244 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:03:33,244 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:03:33,245 INFO L128 BoogieDeclarations]: Found specification of procedure cbzero [2018-02-04 04:03:33,245 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:03:33,245 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:03:33,245 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:03:33,362 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:03:33,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:03:33 BoogieIcfgContainer [2018-02-04 04:03:33,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:03:33,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:03:33,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:03:33,366 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:03:33,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:03:33" (1/3) ... [2018-02-04 04:03:33,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77570374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:03:33, skipping insertion in model container [2018-02-04 04:03:33,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:03:33" (2/3) ... [2018-02-04 04:03:33,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77570374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:03:33, skipping insertion in model container [2018-02-04 04:03:33,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:03:33" (3/3) ... [2018-02-04 04:03:33,369 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cbzero-alloca_true-valid-memsafety_true-termination.i [2018-02-04 04:03:33,376 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:03:33,382 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 04:03:33,435 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:03:33,435 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:03:33,435 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:03:33,435 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:03:33,435 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:03:33,435 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:03:33,436 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:03:33,436 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:03:33,439 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:03:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-02-04 04:03:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 04:03:33,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:33,460 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:33,460 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 04:03:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1815231445, now seen corresponding path program 1 times [2018-02-04 04:03:33,466 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:33,466 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:33,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:33,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:33,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:33,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:03:33,600 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:03:33,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:03:33,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 04:03:33,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 04:03:33,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 04:03:33,611 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-02-04 04:03:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:33,650 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-04 04:03:33,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 04:03:33,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-04 04:03:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:33,656 INFO L225 Difference]: With dead ends: 33 [2018-02-04 04:03:33,656 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 04:03:33,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:03:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 04:03:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-02-04 04:03:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 04:03:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-02-04 04:03:33,727 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-02-04 04:03:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:33,727 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-02-04 04:03:33,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 04:03:33,727 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-02-04 04:03:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 04:03:33,727 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:33,728 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:33,728 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 04:03:33,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1815233367, now seen corresponding path program 1 times [2018-02-04 04:03:33,728 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:33,728 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:33,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:33,729 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:33,729 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:33,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:03:33,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:03:33,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:03:33,758 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:03:33,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:03:33,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:03:33,758 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 3 states. [2018-02-04 04:03:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:33,782 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-02-04 04:03:33,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:03:33,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-02-04 04:03:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:33,783 INFO L225 Difference]: With dead ends: 28 [2018-02-04 04:03:33,783 INFO L226 Difference]: Without dead ends: 27 [2018-02-04 04:03:33,784 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:03:33,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-02-04 04:03:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-02-04 04:03:33,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 04:03:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-02-04 04:03:33,786 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 10 [2018-02-04 04:03:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:33,786 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-02-04 04:03:33,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:03:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-02-04 04:03:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:03:33,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:33,787 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:33,787 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 04:03:33,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281886, now seen corresponding path program 1 times [2018-02-04 04:03:33,787 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:33,787 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:33,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:33,788 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:33,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:33,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:03:33,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:03:33,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:03:33,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 04:03:33,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 04:03:33,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:03:33,878 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-02-04 04:03:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:33,955 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-02-04 04:03:33,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:03:33,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-04 04:03:33,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:33,957 INFO L225 Difference]: With dead ends: 25 [2018-02-04 04:03:33,957 INFO L226 Difference]: Without dead ends: 25 [2018-02-04 04:03:33,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:03:33,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-02-04 04:03:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-02-04 04:03:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 04:03:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-02-04 04:03:33,960 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-02-04 04:03:33,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:33,960 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-02-04 04:03:33,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 04:03:33,960 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-02-04 04:03:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:03:33,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:33,961 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:33,961 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 04:03:33,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1377281887, now seen corresponding path program 1 times [2018-02-04 04:03:33,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:33,962 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:33,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:33,963 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:33,963 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:33,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:03:34,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:03:34,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 04:03:34,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:03:34,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:03:34,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:03:34,069 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-02-04 04:03:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:34,165 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-02-04 04:03:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 04:03:34,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-02-04 04:03:34,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:34,168 INFO L225 Difference]: With dead ends: 31 [2018-02-04 04:03:34,168 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 04:03:34,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-02-04 04:03:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 04:03:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-02-04 04:03:34,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 04:03:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-02-04 04:03:34,173 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2018-02-04 04:03:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:34,173 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-02-04 04:03:34,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:03:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-02-04 04:03:34,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 04:03:34,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:34,174 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:34,174 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 04:03:34,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1525480681, now seen corresponding path program 1 times [2018-02-04 04:03:34,175 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:34,175 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:34,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:34,176 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:34,176 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:34,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:34,265 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-04 04:03:34,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:03:34,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:03:34,266 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:34,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:03:34,323 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-04 04:03:34,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:03:34,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-02-04 04:03:34,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:03:34,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:03:34,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:03:34,325 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 8 states. [2018-02-04 04:03:34,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:34,379 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 04:03:34,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:03:34,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 04:03:34,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:34,380 INFO L225 Difference]: With dead ends: 48 [2018-02-04 04:03:34,380 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 04:03:34,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:03:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 04:03:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-02-04 04:03:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 04:03:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 04:03:34,384 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2018-02-04 04:03:34,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:34,384 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 04:03:34,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:03:34,384 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 04:03:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 04:03:34,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:34,385 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:34,385 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 04:03:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -2112286695, now seen corresponding path program 1 times [2018-02-04 04:03:34,385 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:34,385 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:34,386 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:34,386 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:34,386 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:34,399 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:34,482 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-04 04:03:34,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:03:34,482 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:03:34,483 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:34,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:03:34,524 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-04 04:03:34,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:03:34,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-02-04 04:03:34,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:03:34,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:03:34,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:03:34,525 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 10 states. [2018-02-04 04:03:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:34,606 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-02-04 04:03:34,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:03:34,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-02-04 04:03:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:34,607 INFO L225 Difference]: With dead ends: 73 [2018-02-04 04:03:34,607 INFO L226 Difference]: Without dead ends: 73 [2018-02-04 04:03:34,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-04 04:03:34,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-04 04:03:34,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 42. [2018-02-04 04:03:34,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 04:03:34,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-04 04:03:34,616 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-02-04 04:03:34,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:34,616 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-04 04:03:34,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:03:34,617 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-04 04:03:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 04:03:34,617 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:34,617 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:03:34,617 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 04:03:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1171563351, now seen corresponding path program 1 times [2018-02-04 04:03:34,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:34,618 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:34,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:34,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:34,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:34,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:34,830 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-04 04:03:34,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:03:34,830 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:03:34,831 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:34,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:03:34,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:03:34,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:03:34,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:03:34,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-02-04 04:03:35,047 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-04 04:03:35,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:03:35,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 04:03:35,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 04:03:35,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 04:03:35,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2018-02-04 04:03:35,049 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 22 states. [2018-02-04 04:03:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:35,300 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-02-04 04:03:35,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 04:03:35,301 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 20 [2018-02-04 04:03:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:35,302 INFO L225 Difference]: With dead ends: 51 [2018-02-04 04:03:35,302 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 04:03:35,303 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-02-04 04:03:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 04:03:35,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-02-04 04:03:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 04:03:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-04 04:03:35,305 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 20 [2018-02-04 04:03:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:35,305 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-04 04:03:35,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 04:03:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-04 04:03:35,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 04:03:35,306 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:35,306 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] [2018-02-04 04:03:35,306 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 04:03:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1556914830, now seen corresponding path program 1 times [2018-02-04 04:03:35,306 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:35,306 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:35,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:35,307 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:35,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:35,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:35,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:03:35,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:03:35,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:03:35,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:03:35,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:03:35,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:03:35,378 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2018-02-04 04:03:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:03:35,402 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-04 04:03:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:03:35,403 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 04:03:35,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:03:35,404 INFO L225 Difference]: With dead ends: 59 [2018-02-04 04:03:35,404 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 04:03:35,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:03:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 04:03:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-02-04 04:03:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 04:03:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-02-04 04:03:35,408 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 21 [2018-02-04 04:03:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:03:35,409 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-02-04 04:03:35,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:03:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-02-04 04:03:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 04:03:35,410 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:03:35,410 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] [2018-02-04 04:03:35,410 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cbzeroErr0RequiresViolation, cbzeroErr1RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 04:03:35,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1726935216, now seen corresponding path program 1 times [2018-02-04 04:03:35,411 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:03:35,411 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:03:35,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:35,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:03:35,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:03:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:03:35,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:03:35,423 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-04 04:03:35,426 INFO L168 Benchmark]: Toolchain (without parser) took 2404.49 ms. Allocated memory was 399.0 MB in the beginning and 621.3 MB in the end (delta: 222.3 MB). Free memory was 357.2 MB in the beginning and 467.3 MB in the end (delta: -110.1 MB). Peak memory consumption was 112.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:03:35,427 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:03:35,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.27 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 346.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:03:35,428 INFO L168 Benchmark]: Boogie Preprocessor took 27.25 ms. Allocated memory is still 399.0 MB. Free memory was 346.6 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:03:35,428 INFO L168 Benchmark]: RCFGBuilder took 155.22 ms. Allocated memory is still 399.0 MB. Free memory was 344.0 MB in the beginning and 329.7 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. [2018-02-04 04:03:35,428 INFO L168 Benchmark]: TraceAbstraction took 2061.88 ms. Allocated memory was 399.0 MB in the beginning and 621.3 MB in the end (delta: 222.3 MB). Free memory was 329.7 MB in the beginning and 467.3 MB in the end (delta: -137.6 MB). Peak memory consumption was 84.7 MB. Max. memory is 5.3 GB. [2018-02-04 04:03:35,429 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.17 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 157.27 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 346.6 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.25 ms. Allocated memory is still 399.0 MB. Free memory was 346.6 MB in the beginning and 344.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 155.22 ms. Allocated memory is still 399.0 MB. Free memory was 344.0 MB in the beginning and 329.7 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2061.88 ms. Allocated memory was 399.0 MB in the beginning and 621.3 MB in the end (delta: 222.3 MB). Free memory was 329.7 MB in the beginning and 467.3 MB in the end (delta: -137.6 MB). Peak memory consumption was 84.7 MB. 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_cbzero-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-03-35-436.csv Received shutdown request...