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/simple-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:40:51,383 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:40:51,384 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:40:51,393 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:40:51,394 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:40:51,395 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:40:51,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:40:51,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:40:51,398 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:40:51,399 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:40:51,400 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:40:51,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:40:51,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:40:51,402 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:40:51,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:40:51,404 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:40:51,406 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:40:51,407 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:40:51,408 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:40:51,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:40:51,410 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:40:51,410 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:40:51,411 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:40:51,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:40:51,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:40:51,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:40:51,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:40:51,414 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:40:51,414 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:40:51,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:40:51,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:40:51,415 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:51,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:40:51,426 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:40:51,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:40:51,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:40:51,427 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:40:51,427 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:40:51,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:40:51,428 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:40:51,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:40:51,428 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:40:51,428 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:40:51,428 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:40:51,429 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:40:51,429 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:40:51,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:40:51,429 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:40:51,429 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:40:51,429 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:40:51,430 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:40:51,430 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:40:51,430 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:40:51,430 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:40:51,430 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:40:51,430 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:40:51,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:40:51,471 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:40:51,474 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:40:51,477 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:40:51,478 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:40:51,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i [2018-02-02 10:40:51,623 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:40:51,624 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:40:51,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:40:51,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:40:51,630 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:40:51,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:40:51" (1/1) ... [2018-02-02 10:40:51,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59897e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:51, skipping insertion in model container [2018-02-02 10:40:51,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:40:51" (1/1) ... [2018-02-02 10:40:51,647 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:40:51,673 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:40:51,759 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:40:51,773 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:40:51,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:51 WrapperNode [2018-02-02 10:40:51,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:40:51,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:40:51,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:40:51,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:40:51,787 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:51" (1/1) ... [2018-02-02 10:40:51,787 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:51" (1/1) ... [2018-02-02 10:40:51,793 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:51" (1/1) ... [2018-02-02 10:40:51,793 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:51" (1/1) ... [2018-02-02 10:40:51,796 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:51" (1/1) ... [2018-02-02 10:40:51,798 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:51" (1/1) ... [2018-02-02 10:40:51,799 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:51" (1/1) ... [2018-02-02 10:40:51,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:40:51,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:40:51,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:40:51,801 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:40:51,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:51" (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:51,837 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:40:51,837 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:40:51,837 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-02 10:40:51,837 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-02 10:40:51,838 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:40:51,839 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:40:51,839 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:40:52,039 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:40:52,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:40:52 BoogieIcfgContainer [2018-02-02 10:40:52,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:40:52,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:40:52,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:40:52,043 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:40:52,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:40:51" (1/3) ... [2018-02-02 10:40:52,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49af8e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:40:52, skipping insertion in model container [2018-02-02 10:40:52,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:40:51" (2/3) ... [2018-02-02 10:40:52,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49af8e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:40:52, skipping insertion in model container [2018-02-02 10:40:52,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:40:52" (3/3) ... [2018-02-02 10:40:52,046 INFO L107 eAbstractionObserver]: Analyzing ICFG simple-ext_1_true-valid-memsafety.i [2018-02-02 10:40:52,053 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:40:52,058 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-02-02 10:40:52,082 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:40:52,082 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:40:52,083 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:40:52,083 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:40:52,083 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:40:52,083 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:40:52,083 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:40:52,083 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:40:52,084 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:40:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-02-02 10:40:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 10:40:52,102 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:52,103 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:52,103 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1616503521, now seen corresponding path program 1 times [2018-02-02 10:40:52,139 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:52,173 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:52,197 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:52,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:52,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:40:52,199 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:52,200 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:52,200 INFO L182 omatonBuilderFactory]: Interpolants [68#true, 69#false] [2018-02-02 10:40:52,200 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:52,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 10:40:52,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 10:40:52,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:40:52,212 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-02-02 10:40:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:52,227 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-02 10:40:52,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 10:40:52,228 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-02-02 10:40:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:52,285 INFO L225 Difference]: With dead ends: 65 [2018-02-02 10:40:52,285 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 10:40:52,287 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:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 10:40:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 10:40:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 10:40:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-02-02 10:40:52,315 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 11 [2018-02-02 10:40:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:52,315 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-02-02 10:40:52,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 10:40:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-02-02 10:40:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:40:52,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:52,316 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:52,316 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:52,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2050647052, now seen corresponding path program 1 times [2018-02-02 10:40:52,317 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:52,334 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:52,379 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:52,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:52,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:40:52,380 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:52,380 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:52,380 INFO L182 omatonBuilderFactory]: Interpolants [192#true, 193#false, 194#(= 1 (select |#valid| |main_#t~malloc0.base|)), 195#(= 1 (select |#valid| main_~a~0.base)), 196#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:40:52,380 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:52,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:40:52,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:40:52,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:52,382 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 5 states. [2018-02-02 10:40:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:52,575 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-02-02 10:40:52,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:40:52,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:40:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:52,577 INFO L225 Difference]: With dead ends: 75 [2018-02-02 10:40:52,577 INFO L226 Difference]: Without dead ends: 75 [2018-02-02 10:40:52,578 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:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-02 10:40:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2018-02-02 10:40:52,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 10:40:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-02-02 10:40:52,583 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 14 [2018-02-02 10:40:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:52,584 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-02-02 10:40:52,584 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:40:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-02-02 10:40:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:40:52,584 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:52,585 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:52,585 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:52,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2050647053, now seen corresponding path program 1 times [2018-02-02 10:40:52,586 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:52,600 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:52,663 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:52,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:52,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:40:52,664 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:52,664 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:52,664 INFO L182 omatonBuilderFactory]: Interpolants [340#true, 341#false, 342#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 343#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 344#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:40:52,665 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:52,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:40:52,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:40:52,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:52,666 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2018-02-02 10:40:52,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:52,815 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-02-02 10:40:52,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:52,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 10:40:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:52,816 INFO L225 Difference]: With dead ends: 82 [2018-02-02 10:40:52,817 INFO L226 Difference]: Without dead ends: 82 [2018-02-02 10:40:52,817 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:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-02 10:40:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2018-02-02 10:40:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:40:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-02 10:40:52,823 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 14 [2018-02-02 10:40:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:52,824 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-02 10:40:52,824 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:40:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-02 10:40:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:40:52,825 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:52,825 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:52,825 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1493222104, now seen corresponding path program 1 times [2018-02-02 10:40:52,826 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:52,841 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:52,889 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:52,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:52,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:40:52,889 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:52,890 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:52,890 INFO L182 omatonBuilderFactory]: Interpolants [505#true, 506#false, 507#(not (= 0 |main_#t~malloc0.base|)), 508#(not (= 0 main_~a~0.base)), 509#(not (= 0 main_~p~0.base))] [2018-02-02 10:40:52,890 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:52,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:40:52,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:40:52,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:40:52,891 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 5 states. [2018-02-02 10:40:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:52,951 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-02-02 10:40:52,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:40:52,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 10:40:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:52,952 INFO L225 Difference]: With dead ends: 78 [2018-02-02 10:40:52,952 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 10:40:52,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:52,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 10:40:52,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-02-02 10:40:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-02 10:40:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-02-02 10:40:52,955 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 23 [2018-02-02 10:40:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:52,956 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-02-02 10:40:52,956 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:40:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-02-02 10:40:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:40:52,956 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:52,956 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:52,956 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash -458760131, now seen corresponding path program 1 times [2018-02-02 10:40:52,957 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:52,974 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:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:53,101 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:40:53,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:40:53,102 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:53,102 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:53,102 INFO L182 omatonBuilderFactory]: Interpolants [672#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 673#(and (= 0 |main_#t~mem11.offset|) (= 0 |main_#t~mem11.base|)), 674#(and (= main_~p~0.base 0) (= main_~p~0.offset 0)), 666#true, 667#false, 668#(= 0 |main_#t~malloc0.offset|), 669#(= 0 main_~a~0.offset), 670#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 671#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4))))] [2018-02-02 10:40:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:53,102 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 10:40:53,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 10:40:53,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 10:40:53,103 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 9 states. [2018-02-02 10:40:53,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:53,324 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-02 10:40:53,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:40:53,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-02 10:40:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:53,325 INFO L225 Difference]: With dead ends: 105 [2018-02-02 10:40:53,325 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 10:40:53,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-02-02 10:40:53,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 10:40:53,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2018-02-02 10:40:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-02 10:40:53,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-02-02 10:40:53,330 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 25 [2018-02-02 10:40:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:53,330 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-02-02 10:40:53,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 10:40:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-02-02 10:40:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:40:53,331 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:53,331 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:53,332 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash -290149679, now seen corresponding path program 1 times [2018-02-02 10:40:53,332 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:53,343 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:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:53,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:53,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:40:53,392 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:53,392 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:53,392 INFO L182 omatonBuilderFactory]: Interpolants [880#(= 1 (select |#valid| main_~t~0.base)), 881#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 882#(= 1 (select |#valid| |main_#t~mem6.base|)), 883#(= 1 (select |#valid| main_~p~0.base)), 877#true, 878#false, 879#(= 1 (select |#valid| |main_#t~malloc4.base|))] [2018-02-02 10:40:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:53,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:40:53,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:40:53,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:40:53,393 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 7 states. [2018-02-02 10:40:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:53,542 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-02-02 10:40:53,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:40:53,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-02 10:40:53,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:53,543 INFO L225 Difference]: With dead ends: 87 [2018-02-02 10:40:53,543 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 10:40:53,544 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:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 10:40:53,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2018-02-02 10:40:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-02 10:40:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-02-02 10:40:53,548 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 25 [2018-02-02 10:40:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:53,548 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-02-02 10:40:53,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:40:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-02-02 10:40:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:40:53,549 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:53,549 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:53,549 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:53,549 INFO L82 PathProgramCache]: Analyzing trace with hash -290149678, now seen corresponding path program 1 times [2018-02-02 10:40:53,550 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:53,561 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:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:53,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:40:53,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:40:53,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:53,621 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:53,622 INFO L182 omatonBuilderFactory]: Interpolants [1063#true, 1064#false, 1065#(and (= 0 |main_#t~malloc4.offset|) (= 8 (select |#length| |main_#t~malloc4.base|))), 1066#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 1067#(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)))), 1068#(and (= 0 |main_#t~mem6.offset|) (= 8 (select |#length| |main_#t~mem6.base|))), 1069#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-02 10:40:53,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:40:53,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:40:53,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:40:53,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:40:53,623 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 7 states. [2018-02-02 10:40:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:53,781 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-02 10:40:53,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:40:53,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-02-02 10:40:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:53,783 INFO L225 Difference]: With dead ends: 95 [2018-02-02 10:40:53,783 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 10:40:53,783 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:40:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 10:40:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 70. [2018-02-02 10:40:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 10:40:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-02-02 10:40:53,787 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 25 [2018-02-02 10:40:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:53,788 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-02-02 10:40:53,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:40:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-02-02 10:40:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 10:40:53,788 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:53,789 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 10:40:53,789 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:53,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1498253566, now seen corresponding path program 1 times [2018-02-02 10:40:53,790 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:53,805 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:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:40:53,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:40:53,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:40:53,971 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:40:53,971 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:53,971 INFO L182 omatonBuilderFactory]: Interpolants [1248#true, 1249#false, 1250#(= 0 |main_#t~malloc0.offset|), 1251#(= 0 main_~a~0.offset), 1252#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base)), 1253#(and (= 0 (select (select |#memory_$Pointer$.base| main_~a~0.base) (+ 0 4))) (= 0 main_~a~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~a~0.base) (+ 0 4)))), 1254#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 1255#(and (= 0 |main_#t~mem13.offset|) (= 0 |main_#t~mem13.base|) (= main_~p~0.offset 0)), 1256#(and (= 0 main_~t~0.offset) (= main_~p~0.offset 0) (= 0 main_~t~0.base)), 1257#(and (= 0 main_~t~0.offset) (= 0 main_~t~0.base)), 1258#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))] [2018-02-02 10:40:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 10:40:53,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 10:40:53,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 10:40:53,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:40:53,972 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 11 states. [2018-02-02 10:40:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:40:54,181 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-02-02 10:40:54,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 10:40:54,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-02-02 10:40:54,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:40:54,182 INFO L225 Difference]: With dead ends: 91 [2018-02-02 10:40:54,182 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 10:40:54,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:40:54,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 10:40:54,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-02-02 10:40:54,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-02 10:40:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-02-02 10:40:54,186 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 34 [2018-02-02 10:40:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:40:54,187 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-02-02 10:40:54,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 10:40:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-02-02 10:40:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 10:40:54,188 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:40:54,188 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:40:54,188 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:40:54,188 INFO L82 PathProgramCache]: Analyzing trace with hash -798781214, now seen corresponding path program 1 times [2018-02-02 10:40:54,189 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:40:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:40:54,206 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:54,210 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:54,213 INFO L168 Benchmark]: Toolchain (without parser) took 2589.20 ms. Allocated memory was 403.2 MB in the beginning and 665.8 MB in the end (delta: 262.7 MB). Free memory was 360.1 MB in the beginning and 637.1 MB in the end (delta: -277.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:40:54,214 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:40:54,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.13 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 349.5 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:54,214 INFO L168 Benchmark]: Boogie Preprocessor took 22.70 ms. Allocated memory is still 403.2 MB. Free memory was 349.5 MB in the beginning and 348.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:54,214 INFO L168 Benchmark]: RCFGBuilder took 239.30 ms. Allocated memory is still 403.2 MB. Free memory was 348.1 MB in the beginning and 324.8 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:40:54,214 INFO L168 Benchmark]: TraceAbstraction took 2171.53 ms. Allocated memory was 403.2 MB in the beginning and 665.8 MB in the end (delta: 262.7 MB). Free memory was 323.5 MB in the beginning and 637.1 MB in the end (delta: -313.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:40:54,216 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.20 ms. Allocated memory is still 403.2 MB. Free memory is still 366.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.13 ms. Allocated memory is still 403.2 MB. Free memory was 360.1 MB in the beginning and 349.5 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.70 ms. Allocated memory is still 403.2 MB. Free memory was 349.5 MB in the beginning and 348.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 239.30 ms. Allocated memory is still 403.2 MB. Free memory was 348.1 MB in the beginning and 324.8 MB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2171.53 ms. Allocated memory was 403.2 MB in the beginning and 665.8 MB in the end (delta: 262.7 MB). Free memory was 323.5 MB in the beginning and 637.1 MB in the end (delta: -313.6 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/simple-ext_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-40-54-220.csv Received shutdown request...