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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:40:36,629 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:40:36,630 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:40:36,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:40:36,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:40:36,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:40:36,641 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:40:36,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:40:36,645 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:40:36,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:40:36,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:40:36,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:40:36,647 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:40:36,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:40:36,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:40:36,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:40:36,652 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:40:36,653 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:40:36,654 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:40:36,655 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:40:36,657 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:40:36,657 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:40:36,657 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:40:36,658 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:40:36,659 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:40:36,660 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:40:36,661 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:40:36,661 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:40:36,661 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:40:36,661 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:40:36,662 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:40:36,662 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:40:36,672 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:40:36,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:40:36,673 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:40:36,673 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:40:36,673 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:40:36,673 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:40:36,673 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:40:36,674 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:40:36,674 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:40:36,674 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:40:36,674 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:40:36,674 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:40:36,674 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:40:36,675 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:40:36,675 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:40:36,675 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:40:36,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:40:36,675 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:40:36,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:40:36,676 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:40:36,676 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:40:36,676 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:40:36,676 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:40:36,676 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:40:36,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:40:36,713 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:40:36,716 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:40:36,717 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:40:36,718 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:40:36,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_false-unreach-call_false-valid-deref.i [2018-02-02 10:40:36,845 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:40:36,846 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:40:36,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:40:36,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:40:36,853 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:40:36,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:40:36" (1/1) ... [2018-02-02 10:40:36,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49389d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:36, skipping insertion in model container [2018-02-02 10:40:36,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:40:36" (1/1) ... [2018-02-02 10:40:36,871 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:40:36,900 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:40:36,993 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:40:37,008 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:40:37,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:37 WrapperNode [2018-02-02 10:40:37,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:40:37,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:40:37,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:40:37,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:40:37,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:37" (1/1) ... [2018-02-02 10:40:37,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:37" (1/1) ... [2018-02-02 10:40:37,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:37" (1/1) ... [2018-02-02 10:40:37,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:37" (1/1) ... [2018-02-02 10:40:37,041 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:37" (1/1) ... [2018-02-02 10:40:37,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:37" (1/1) ... [2018-02-02 10:40:37,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:37" (1/1) ... [2018-02-02 10:40:37,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:40:37,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:40:37,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:40:37,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:40:37,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:37" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:40:37,085 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:40:37,085 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:40:37,086 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-02 10:40:37,086 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:40:37,086 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:40:37,086 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:40:37,086 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:40:37,086 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:40:37,086 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:40:37,086 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:40:37,087 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:40:37,087 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:40:37,087 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:40:37,087 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:40:37,087 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:40:37,087 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-02 10:40:37,087 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:40:37,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:40:37,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:40:37,379 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:40:37,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:40:37 BoogieIcfgContainer [2018-02-02 10:40:37,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:40:37,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:40:37,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:40:37,383 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:40:37,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:40:36" (1/3) ... [2018-02-02 10:40:37,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fac0871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:40:37, skipping insertion in model container [2018-02-02 10:40:37,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:37" (2/3) ... [2018-02-02 10:40:37,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fac0871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:40:37, skipping insertion in model container [2018-02-02 10:40:37,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:40:37" (3/3) ... [2018-02-02 10:40:37,386 INFO L107 eAbstractionObserver]: Analyzing ICFG list-ext_false-unreach-call_false-valid-deref.i [2018-02-02 10:40:37,393 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:40:37,398 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2018-02-02 10:40:37,429 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:40:37,429 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:40:37,429 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:40:37,429 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:40:37,429 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:40:37,430 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:40:37,430 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:40:37,430 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:40:37,431 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:40:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-02-02 10:40:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:40:37,452 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:37,453 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:37,453 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:37,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2135487731, now seen corresponding path program 1 times [2018-02-02 10:40:37,498 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:37,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:37,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:37,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:40:37,569 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:37,570 INFO L182 omatonBuilderFactory]: Interpolants [102#true, 103#false] [2018-02-02 10:40:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:37,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 10:40:37,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 10:40:37,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:40:37,581 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2018-02-02 10:40:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:37,665 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-02-02 10:40:37,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 10:40:37,666 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-02-02 10:40:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:37,671 INFO L225 Difference]: With dead ends: 99 [2018-02-02 10:40:37,672 INFO L226 Difference]: Without dead ends: 90 [2018-02-02 10:40:37,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:40:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-02-02 10:40:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-02-02 10:40:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-02-02 10:40:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-02-02 10:40:37,701 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 13 [2018-02-02 10:40:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:37,702 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-02-02 10:40:37,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 10:40:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-02-02 10:40:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:40:37,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:37,703 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:37,703 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:37,703 INFO L82 PathProgramCache]: Analyzing trace with hash 757106509, now seen corresponding path program 1 times [2018-02-02 10:40:37,704 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:37,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:37,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:37,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:40:37,789 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:37,789 INFO L182 omatonBuilderFactory]: Interpolants [293#true, 294#false, 295#(= 1 (select |#valid| |main_#t~malloc0.base|)), 296#(= 1 (select |#valid| main_~a~0.base)), 297#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:40:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:37,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:40:37,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:40:37,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:37,791 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 5 states. [2018-02-02 10:40:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:37,952 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2018-02-02 10:40:37,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:40:37,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:40:37,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:37,954 INFO L225 Difference]: With dead ends: 111 [2018-02-02 10:40:37,954 INFO L226 Difference]: Without dead ends: 111 [2018-02-02 10:40:37,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:40:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-02 10:40:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2018-02-02 10:40:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:40:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2018-02-02 10:40:37,963 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 15 [2018-02-02 10:40:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:37,963 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2018-02-02 10:40:37,963 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:40:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2018-02-02 10:40:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:40:37,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:37,964 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:37,964 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:37,964 INFO L82 PathProgramCache]: Analyzing trace with hash 757106510, now seen corresponding path program 1 times [2018-02-02 10:40:37,965 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:37,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:38,051 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:38,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:40:38,051 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:38,052 INFO L182 omatonBuilderFactory]: Interpolants [512#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 513#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 514#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 510#true, 511#false] [2018-02-02 10:40:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:38,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:40:38,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:40:38,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:38,053 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand 5 states. [2018-02-02 10:40:38,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:38,186 INFO L93 Difference]: Finished difference Result 130 states and 143 transitions. [2018-02-02 10:40:38,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:38,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:40:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:38,187 INFO L225 Difference]: With dead ends: 130 [2018-02-02 10:40:38,188 INFO L226 Difference]: Without dead ends: 130 [2018-02-02 10:40:38,188 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:40:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-02 10:40:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2018-02-02 10:40:38,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-02 10:40:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2018-02-02 10:40:38,195 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 15 [2018-02-02 10:40:38,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:38,196 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2018-02-02 10:40:38,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:40:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2018-02-02 10:40:38,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:40:38,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:38,198 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:38,198 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:38,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1442918817, now seen corresponding path program 1 times [2018-02-02 10:40:38,199 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:38,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:38,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:38,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:40:38,269 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:38,269 INFO L182 omatonBuilderFactory]: Interpolants [768#true, 769#false, 770#(= 1 (select |#valid| |main_#t~malloc5.base|)), 771#(= 1 (select |#valid| main_~t~0.base)), 772#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 773#(= 1 (select |#valid| |main_#t~mem7.base|)), 774#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:40:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:38,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:40:38,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:40:38,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:40:38,270 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand 7 states. [2018-02-02 10:40:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:38,541 INFO L93 Difference]: Finished difference Result 226 states and 253 transitions. [2018-02-02 10:40:38,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:40:38,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:40:38,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:38,545 INFO L225 Difference]: With dead ends: 226 [2018-02-02 10:40:38,546 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 10:40:38,547 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:40:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 10:40:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 124. [2018-02-02 10:40:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 10:40:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-02-02 10:40:38,556 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 26 [2018-02-02 10:40:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:38,556 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-02-02 10:40:38,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:40:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-02-02 10:40:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:40:38,557 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:38,557 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:38,557 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:38,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1442918818, now seen corresponding path program 1 times [2018-02-02 10:40:38,558 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:38,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:38,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:38,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:40:38,678 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:38,679 INFO L182 omatonBuilderFactory]: Interpolants [1136#true, 1137#false, 1138#(and (= 0 |main_#t~malloc5.offset|) (= 8 (select |#length| |main_#t~malloc5.base|))), 1139#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 1140#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 1141#(and (= 8 (select |#length| |main_#t~mem7.base|)) (= 0 |main_#t~mem7.offset|)), 1142#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:40:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:38,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:40:38,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:40:38,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:40:38,680 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 7 states. [2018-02-02 10:40:38,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:38,972 INFO L93 Difference]: Finished difference Result 242 states and 271 transitions. [2018-02-02 10:40:38,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:40:38,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:40:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:38,974 INFO L225 Difference]: With dead ends: 242 [2018-02-02 10:40:38,974 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 10:40:38,975 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:40:38,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 10:40:38,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 105. [2018-02-02 10:40:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 10:40:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-02-02 10:40:38,980 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 26 [2018-02-02 10:40:38,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:38,980 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-02-02 10:40:38,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:40:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-02-02 10:40:38,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:40:38,981 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:38,981 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:38,981 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:38,981 INFO L82 PathProgramCache]: Analyzing trace with hash 317364595, now seen corresponding path program 1 times [2018-02-02 10:40:38,981 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:38,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:39,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:40:39,037 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,037 INFO L182 omatonBuilderFactory]: Interpolants [1505#true, 1506#false, 1507#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1508#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3), 1509#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 1510#(= |main_#t~mem16| 3)] [2018-02-02 10:40:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:40:39,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:40:39,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:40:39,039 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 6 states. [2018-02-02 10:40:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:39,135 INFO L93 Difference]: Finished difference Result 187 states and 204 transitions. [2018-02-02 10:40:39,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:40:39,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-02 10:40:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:39,136 INFO L225 Difference]: With dead ends: 187 [2018-02-02 10:40:39,136 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 10:40:39,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:40:39,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 10:40:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 118. [2018-02-02 10:40:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-02 10:40:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2018-02-02 10:40:39,141 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 134 transitions. Word has length 27 [2018-02-02 10:40:39,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:39,141 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 134 transitions. [2018-02-02 10:40:39,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:40:39,141 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 134 transitions. [2018-02-02 10:40:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:40:39,142 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:39,142 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:39,142 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:39,142 INFO L82 PathProgramCache]: Analyzing trace with hash 135192649, now seen corresponding path program 1 times [2018-02-02 10:40:39,143 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:39,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:39,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:40:39,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,201 INFO L182 omatonBuilderFactory]: Interpolants [1824#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 1825#(= 1 (select |#valid| |main_#t~mem14.base|)), 1826#(= 1 (select |#valid| main_~p~0.base)), 1820#true, 1821#false, 1822#(= 1 (select |#valid| |main_#t~malloc12.base|)), 1823#(= 1 (select |#valid| main_~t~0.base))] [2018-02-02 10:40:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:40:39,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:40:39,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:40:39,202 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. Second operand 7 states. [2018-02-02 10:40:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:39,345 INFO L93 Difference]: Finished difference Result 157 states and 177 transitions. [2018-02-02 10:40:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:40:39,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 10:40:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:39,346 INFO L225 Difference]: With dead ends: 157 [2018-02-02 10:40:39,346 INFO L226 Difference]: Without dead ends: 157 [2018-02-02 10:40:39,346 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:40:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-02 10:40:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 116. [2018-02-02 10:40:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 10:40:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2018-02-02 10:40:39,348 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 30 [2018-02-02 10:40:39,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:39,349 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2018-02-02 10:40:39,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:40:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2018-02-02 10:40:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:40:39,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:39,349 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:39,349 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash 135192650, now seen corresponding path program 1 times [2018-02-02 10:40:39,350 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:39,359 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,431 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:39,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:40:39,431 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,431 INFO L182 omatonBuilderFactory]: Interpolants [2112#false, 2113#(and (= 0 |main_#t~malloc12.offset|) (= 8 (select |#length| |main_#t~malloc12.base|))), 2114#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 2115#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 2116#(and (= 8 (select |#length| |main_#t~mem14.base|)) (= 0 |main_#t~mem14.offset|)), 2117#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 2111#true] [2018-02-02 10:40:39,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:40:39,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:40:39,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:40:39,432 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand 7 states. [2018-02-02 10:40:39,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:39,646 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2018-02-02 10:40:39,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:40:39,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 10:40:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:39,647 INFO L225 Difference]: With dead ends: 171 [2018-02-02 10:40:39,647 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 10:40:39,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:40:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 10:40:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 101. [2018-02-02 10:40:39,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-02-02 10:40:39,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2018-02-02 10:40:39,651 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 30 [2018-02-02 10:40:39,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:39,651 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2018-02-02 10:40:39,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:40:39,651 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2018-02-02 10:40:39,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 10:40:39,657 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:39,658 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:39,658 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:39,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1848368372, now seen corresponding path program 1 times [2018-02-02 10:40:39,659 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:39,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:39,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:40:39,706 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,706 INFO L182 omatonBuilderFactory]: Interpolants [2403#true, 2404#false, 2405#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 2406#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3), 2407#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3), 2408#(= |main_#t~mem19| 3)] [2018-02-02 10:40:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:40:39,707 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:40:39,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:40:39,707 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 6 states. [2018-02-02 10:40:39,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:39,817 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2018-02-02 10:40:39,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:40:39,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 10:40:39,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:39,818 INFO L225 Difference]: With dead ends: 156 [2018-02-02 10:40:39,818 INFO L226 Difference]: Without dead ends: 156 [2018-02-02 10:40:39,819 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:40:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-02-02 10:40:39,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 104. [2018-02-02 10:40:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-02-02 10:40:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2018-02-02 10:40:39,821 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 30 [2018-02-02 10:40:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:39,821 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-02-02 10:40:39,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:40:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-02-02 10:40:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:40:39,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:39,822 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:39,822 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash 772815435, now seen corresponding path program 1 times [2018-02-02 10:40:39,823 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:39,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:39,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:40:39,849 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,849 INFO L182 omatonBuilderFactory]: Interpolants [2673#true, 2674#false, 2675#(and (= main_~y~0 0) (= main_~i~0 0))] [2018-02-02 10:40:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:39,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:40:39,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:40:39,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:40:39,850 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 3 states. [2018-02-02 10:40:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:39,860 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2018-02-02 10:40:39,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:40:39,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-02-02 10:40:39,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:39,861 INFO L225 Difference]: With dead ends: 105 [2018-02-02 10:40:39,861 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:40:39,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:40:39,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:40:39,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 10:40:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 10:40:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-02-02 10:40:39,864 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 35 [2018-02-02 10:40:39,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:39,864 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-02-02 10:40:39,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:40:39,864 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-02-02 10:40:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 10:40:39,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:39,865 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:39,865 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr32EnsuresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1113019023, now seen corresponding path program 1 times [2018-02-02 10:40:39,866 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:39,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:40:39,887 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.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:40:39,890 INFO L168 Benchmark]: Toolchain (without parser) took 3045.02 ms. Allocated memory was 397.4 MB in the beginning and 674.2 MB in the end (delta: 276.8 MB). Free memory was 353.9 MB in the beginning and 588.4 MB in the end (delta: -234.5 MB). Peak memory consumption was 42.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:39,891 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 397.4 MB. Free memory is still 360.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:40:39,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.10 ms. Allocated memory is still 397.4 MB. Free memory was 353.9 MB in the beginning and 343.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:39,892 INFO L168 Benchmark]: Boogie Preprocessor took 30.40 ms. Allocated memory is still 397.4 MB. Free memory was 343.3 MB in the beginning and 340.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:39,892 INFO L168 Benchmark]: RCFGBuilder took 333.60 ms. Allocated memory is still 397.4 MB. Free memory was 340.7 MB in the beginning and 310.1 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:39,892 INFO L168 Benchmark]: TraceAbstraction took 2509.53 ms. Allocated memory was 397.4 MB in the beginning and 674.2 MB in the end (delta: 276.8 MB). Free memory was 310.1 MB in the beginning and 588.4 MB in the end (delta: -278.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:40:39,894 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 397.4 MB. Free memory is still 360.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.10 ms. Allocated memory is still 397.4 MB. Free memory was 353.9 MB in the beginning and 343.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.40 ms. Allocated memory is still 397.4 MB. Free memory was 343.3 MB in the beginning and 340.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 333.60 ms. Allocated memory is still 397.4 MB. Free memory was 340.7 MB in the beginning and 310.1 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2509.53 ms. Allocated memory was 397.4 MB in the beginning and 674.2 MB in the end (delta: 276.8 MB). Free memory was 310.1 MB in the beginning and 588.4 MB in the end (delta: -278.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-40-39-899.csv Received shutdown request...