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/memsafety/test-0158_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 18:00:22,116 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 18:00:22,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 18:00:22,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 18:00:22,127 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 18:00:22,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 18:00:22,128 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 18:00:22,130 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 18:00:22,131 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 18:00:22,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 18:00:22,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 18:00:22,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 18:00:22,132 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 18:00:22,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 18:00:22,134 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 18:00:22,136 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 18:00:22,137 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 18:00:22,139 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 18:00:22,140 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 18:00:22,140 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 18:00:22,142 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 18:00:22,142 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 18:00:22,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 18:00:22,143 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 18:00:22,144 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 18:00:22,145 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 18:00:22,145 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 18:00:22,145 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 18:00:22,146 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 18:00:22,146 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 18:00:22,146 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 18:00:22,146 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 18:00:22,155 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 18:00:22,156 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 18:00:22,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 18:00:22,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 18:00:22,157 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 18:00:22,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 18:00:22,157 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 18:00:22,157 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 18:00:22,158 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 18:00:22,158 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 18:00:22,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 18:00:22,158 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 18:00:22,158 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 18:00:22,158 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 18:00:22,159 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 18:00:22,159 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 18:00:22,159 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 18:00:22,159 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 18:00:22,159 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 18:00:22,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 18:00:22,159 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 18:00:22,160 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 18:00:22,160 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 18:00:22,160 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 18:00:22,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 18:00:22,196 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 18:00:22,200 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 18:00:22,201 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 18:00:22,201 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 18:00:22,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0158_true-valid-memsafety_true-termination.i [2018-02-04 18:00:22,340 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 18:00:22,341 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 18:00:22,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 18:00:22,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 18:00:22,347 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 18:00:22,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:00:22" (1/1) ... [2018-02-04 18:00:22,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcd3c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22, skipping insertion in model container [2018-02-04 18:00:22,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 06:00:22" (1/1) ... [2018-02-04 18:00:22,363 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:00:22,390 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 18:00:22,467 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:00:22,477 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 18:00:22,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22 WrapperNode [2018-02-04 18:00:22,482 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 18:00:22,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 18:00:22,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 18:00:22,483 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 18:00:22,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22" (1/1) ... [2018-02-04 18:00:22,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22" (1/1) ... [2018-02-04 18:00:22,503 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22" (1/1) ... [2018-02-04 18:00:22,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22" (1/1) ... [2018-02-04 18:00:22,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22" (1/1) ... [2018-02-04 18:00:22,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22" (1/1) ... [2018-02-04 18:00:22,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22" (1/1) ... [2018-02-04 18:00:22,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 18:00:22,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 18:00:22,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 18:00:22,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 18:00:22,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22" (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 18:00:22,538 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 18:00:22,538 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 18:00:22,538 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 18:00:22,538 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 18:00:22,538 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 18:00:22,538 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 18:00:22,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 18:00:22,539 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 18:00:22,539 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 18:00:22,539 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 18:00:22,539 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 18:00:22,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 18:00:22,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 18:00:22,637 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 18:00:22,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:00:22 BoogieIcfgContainer [2018-02-04 18:00:22,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 18:00:22,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 18:00:22,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 18:00:22,640 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 18:00:22,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 06:00:22" (1/3) ... [2018-02-04 18:00:22,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9b8f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:00:22, skipping insertion in model container [2018-02-04 18:00:22,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 06:00:22" (2/3) ... [2018-02-04 18:00:22,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a9b8f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 06:00:22, skipping insertion in model container [2018-02-04 18:00:22,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 06:00:22" (3/3) ... [2018-02-04 18:00:22,643 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0158_true-valid-memsafety_true-termination.i [2018-02-04 18:00:22,651 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 18:00:22,657 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 18:00:22,689 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 18:00:22,689 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 18:00:22,690 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 18:00:22,690 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 18:00:22,690 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 18:00:22,690 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 18:00:22,690 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 18:00:22,690 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 18:00:22,691 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 18:00:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-02-04 18:00:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 18:00:22,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:00:22,710 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:00:22,710 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:00:22,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1417784654, now seen corresponding path program 1 times [2018-02-04 18:00:22,715 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:00:22,716 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:00:22,755 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:00:22,756 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:00:22,756 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:00:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:00:22,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:00:22,803 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:00:22,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:00:22,803 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:00:22,804 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:00:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:00:22,832 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:00:22,859 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 18:00:22,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:22,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:22,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:00:22,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 18:00:22,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:22,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:00:22,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 18:00:22,896 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 18:00:22,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:00:22,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 18:00:22,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 18:00:22,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 18:00:22,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 18:00:22,908 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-02-04 18:00:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:00:22,983 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2018-02-04 18:00:22,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 18:00:22,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-02-04 18:00:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:00:22,989 INFO L225 Difference]: With dead ends: 24 [2018-02-04 18:00:22,990 INFO L226 Difference]: Without dead ends: 21 [2018-02-04 18:00:22,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 1 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 18:00:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-02-04 18:00:23,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-02-04 18:00:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-02-04 18:00:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2018-02-04 18:00:23,008 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 8 [2018-02-04 18:00:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:00:23,009 INFO L432 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2018-02-04 18:00:23,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 18:00:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2018-02-04 18:00:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-04 18:00:23,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:00:23,009 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:00:23,009 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:00:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1417784655, now seen corresponding path program 1 times [2018-02-04 18:00:23,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:00:23,010 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:00:23,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:00:23,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:00:23,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:00:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:00:23,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:00:23,028 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:00:23,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:00:23,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:00:23,029 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:00:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:00:23,043 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:00:23,057 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 18:00:23,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,072 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 18:00:23,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 18:00:23,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-02-04 18:00:23,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,109 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 18:00:23,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 18:00:23,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 18:00:23,132 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 18:00:23,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:00:23,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 18:00:23,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 18:00:23,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 18:00:23,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 18:00:23,134 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 4 states. [2018-02-04 18:00:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:00:23,169 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2018-02-04 18:00:23,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 18:00:23,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-04 18:00:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:00:23,170 INFO L225 Difference]: With dead ends: 18 [2018-02-04 18:00:23,170 INFO L226 Difference]: Without dead ends: 18 [2018-02-04 18:00:23,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 18:00:23,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-02-04 18:00:23,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-02-04 18:00:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-02-04 18:00:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 17 transitions. [2018-02-04 18:00:23,173 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 17 transitions. Word has length 8 [2018-02-04 18:00:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:00:23,173 INFO L432 AbstractCegarLoop]: Abstraction has 18 states and 17 transitions. [2018-02-04 18:00:23,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 18:00:23,173 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 17 transitions. [2018-02-04 18:00:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 18:00:23,173 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:00:23,173 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:00:23,173 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:00:23,174 INFO L82 PathProgramCache]: Analyzing trace with hash 514218689, now seen corresponding path program 1 times [2018-02-04 18:00:23,174 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:00:23,174 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:00:23,174 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:00:23,174 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:00:23,175 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:00:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:00:23,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:00:23,185 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:00:23,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:00:23,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:00:23,185 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:00:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:00:23,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:00:23,211 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 11 treesize of output 8 [2018-02-04 18:00:23,212 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 8 treesize of output 7 [2018-02-04 18:00:23,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-04 18:00:23,235 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 21 treesize of output 16 [2018-02-04 18:00:23,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 18:00:23,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-02-04 18:00:23,266 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 24 treesize of output 18 [2018-02-04 18:00:23,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-02-04 18:00:23,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:3 [2018-02-04 18:00:23,282 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 18:00:23,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:00:23,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:00:23,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:00:23,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:00:23,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:00:23,283 INFO L87 Difference]: Start difference. First operand 18 states and 17 transitions. Second operand 6 states. [2018-02-04 18:00:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:00:23,325 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2018-02-04 18:00:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:00:23,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-02-04 18:00:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:00:23,326 INFO L225 Difference]: With dead ends: 17 [2018-02-04 18:00:23,326 INFO L226 Difference]: Without dead ends: 17 [2018-02-04 18:00:23,327 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:00:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-02-04 18:00:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-02-04 18:00:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-02-04 18:00:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2018-02-04 18:00:23,329 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 11 [2018-02-04 18:00:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:00:23,329 INFO L432 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2018-02-04 18:00:23,329 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:00:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2018-02-04 18:00:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 18:00:23,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:00:23,330 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:00:23,330 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:00:23,331 INFO L82 PathProgramCache]: Analyzing trace with hash 514218690, now seen corresponding path program 1 times [2018-02-04 18:00:23,331 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:00:23,331 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:00:23,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:00:23,332 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:00:23,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:00:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:00:23,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:00:23,346 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:00:23,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:00:23,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:00:23,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:00:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:00:23,366 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:00:23,370 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 18:00:23,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 18:00:23,384 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 11 treesize of output 8 [2018-02-04 18:00:23,386 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 8 treesize of output 7 [2018-02-04 18:00:23,387 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-02-04 18:00:23,401 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 23 treesize of output 18 [2018-02-04 18:00:23,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 25 [2018-02-04 18:00:23,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-04 18:00:23,427 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 26 treesize of output 20 [2018-02-04 18:00:23,430 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-02-04 18:00:23,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:5 [2018-02-04 18:00:23,440 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 18:00:23,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:00:23,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 18:00:23,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 18:00:23,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 18:00:23,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 18:00:23,441 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand 6 states. [2018-02-04 18:00:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:00:23,488 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2018-02-04 18:00:23,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 18:00:23,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-02-04 18:00:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:00:23,489 INFO L225 Difference]: With dead ends: 16 [2018-02-04 18:00:23,489 INFO L226 Difference]: Without dead ends: 16 [2018-02-04 18:00:23,489 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-02-04 18:00:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-02-04 18:00:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-02-04 18:00:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-02-04 18:00:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-02-04 18:00:23,491 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 11 [2018-02-04 18:00:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:00:23,491 INFO L432 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-02-04 18:00:23,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 18:00:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-02-04 18:00:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 18:00:23,492 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 18:00:23,492 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 18:00:23,492 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 18:00:23,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1518594947, now seen corresponding path program 1 times [2018-02-04 18:00:23,492 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 18:00:23,493 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 18:00:23,493 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:00:23,493 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:00:23,494 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 18:00:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:00:23,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 18:00:23,509 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 18:00:23,509 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 18:00:23,509 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 18:00:23,510 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 18:00:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 18:00:23,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 18:00:23,566 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 11 treesize of output 8 [2018-02-04 18:00:23,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 18:00:23,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:39 [2018-02-04 18:00:23,595 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 47 treesize of output 38 [2018-02-04 18:00:23,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,598 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 57 [2018-02-04 18:00:23,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-02-04 18:00:23,628 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 50 treesize of output 40 [2018-02-04 18:00:23,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,631 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 18:00:23,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-02-04 18:00:23,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 18:00:23,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:27 [2018-02-04 18:00:23,687 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~mem3.base| Int) (|main_~#data~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#data~0.base| 1))) (and (not (= |main_#t~mem3.base| 0)) (= (select .cse0 |main_#t~mem3.base|) 0) (= |c_#valid| (store (store .cse0 |main_#t~mem3.base| 0) |main_~#data~0.base| 0)) (= (select |c_old(#valid)| |main_~#data~0.base|) 0)))) is different from true [2018-02-04 18:00:23,690 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 18:00:23,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 18:00:23,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 18:00:23,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 18:00:23,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 18:00:23,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=52, Unknown=5, NotChecked=14, Total=90 [2018-02-04 18:00:23,692 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 10 states. [2018-02-04 18:00:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 18:00:23,858 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-02-04 18:00:23,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 18:00:23,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-02-04 18:00:23,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 18:00:23,858 INFO L225 Difference]: With dead ends: 15 [2018-02-04 18:00:23,859 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 18:00:23,859 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=114, Unknown=6, NotChecked=22, Total=182 [2018-02-04 18:00:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 18:00:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 18:00:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 18:00:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 18:00:23,859 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-02-04 18:00:23,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 18:00:23,859 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 18:00:23,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 18:00:23,859 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 18:00:23,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 18:00:23,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 06:00:23 BoogieIcfgContainer [2018-02-04 18:00:23,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 18:00:23,863 INFO L168 Benchmark]: Toolchain (without parser) took 1523.24 ms. Allocated memory was 403.7 MB in the beginning and 612.4 MB in the end (delta: 208.7 MB). Free memory was 361.9 MB in the beginning and 445.9 MB in the end (delta: -84.0 MB). Peak memory consumption was 124.7 MB. Max. memory is 5.3 GB. [2018-02-04 18:00:23,864 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 18:00:23,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.77 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 351.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:00:23,864 INFO L168 Benchmark]: Boogie Preprocessor took 23.64 ms. Allocated memory is still 403.7 MB. Free memory was 351.3 MB in the beginning and 350.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:00:23,864 INFO L168 Benchmark]: RCFGBuilder took 131.04 ms. Allocated memory is still 403.7 MB. Free memory was 348.7 MB in the beginning and 334.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. [2018-02-04 18:00:23,864 INFO L168 Benchmark]: TraceAbstraction took 1224.91 ms. Allocated memory was 403.7 MB in the beginning and 612.4 MB in the end (delta: 208.7 MB). Free memory was 334.5 MB in the beginning and 445.9 MB in the end (delta: -111.4 MB). Peak memory consumption was 97.3 MB. Max. memory is 5.3 GB. [2018-02-04 18:00:23,865 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.15 ms. Allocated memory is still 403.7 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 140.77 ms. Allocated memory is still 403.7 MB. Free memory was 360.6 MB in the beginning and 351.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.64 ms. Allocated memory is still 403.7 MB. Free memory was 351.3 MB in the beginning and 350.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 131.04 ms. Allocated memory is still 403.7 MB. Free memory was 348.7 MB in the beginning and 334.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1224.91 ms. Allocated memory was 403.7 MB in the beginning and 612.4 MB in the end (delta: 208.7 MB). Free memory was 334.5 MB in the beginning and 445.9 MB in the end (delta: -111.4 MB). Peak memory consumption was 97.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 9 error locations. SAFE Result, 1.1s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 SDtfs, 45 SDslu, 78 SDs, 0 SdLazy, 125 SolverSat, 15 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 48 ConstructedInterpolants, 5 QuantifiedInterpolants, 5063 SizeOfPredicates, 15 NumberOfNonLiveVariables, 290 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_18-00-23-870.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_18-00-23-870.csv Received shutdown request...