java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 04:18:09,987 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 04:18:09,988 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 04:18:09,998 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 04:18:09,999 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 04:18:09,999 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 04:18:10,000 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 04:18:10,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 04:18:10,004 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 04:18:10,004 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 04:18:10,005 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 04:18:10,005 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 04:18:10,006 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 04:18:10,007 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 04:18:10,008 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 04:18:10,010 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 04:18:10,012 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 04:18:10,013 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 04:18:10,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 04:18:10,016 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 04:18:10,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 04:18:10,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 04:18:10,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 04:18:10,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 04:18:10,019 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 04:18:10,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 04:18:10,021 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 04:18:10,021 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 04:18:10,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 04:18:10,021 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 04:18:10,022 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 04:18:10,022 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 04:18:10,033 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 04:18:10,034 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 04:18:10,035 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 04:18:10,035 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 04:18:10,035 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 04:18:10,035 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 04:18:10,035 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 04:18:10,036 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 04:18:10,036 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 04:18:10,036 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 04:18:10,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 04:18:10,036 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 04:18:10,036 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 04:18:10,036 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 04:18:10,037 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 04:18:10,037 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 04:18:10,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 04:18:10,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 04:18:10,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 04:18:10,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 04:18:10,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:18:10,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 04:18:10,038 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 04:18:10,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 04:18:10,038 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 04:18:10,070 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 04:18:10,083 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 04:18:10,086 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 04:18:10,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 04:18:10,087 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 04:18:10,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-04 04:18:10,224 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 04:18:10,225 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 04:18:10,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 04:18:10,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 04:18:10,232 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 04:18:10,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:18:10" (1/1) ... [2018-02-04 04:18:10,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb72e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10, skipping insertion in model container [2018-02-04 04:18:10,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:18:10" (1/1) ... [2018-02-04 04:18:10,252 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:18:10,294 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 04:18:10,381 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:18:10,393 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 04:18:10,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10 WrapperNode [2018-02-04 04:18:10,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 04:18:10,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 04:18:10,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 04:18:10,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 04:18:10,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10" (1/1) ... [2018-02-04 04:18:10,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10" (1/1) ... [2018-02-04 04:18:10,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10" (1/1) ... [2018-02-04 04:18:10,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10" (1/1) ... [2018-02-04 04:18:10,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10" (1/1) ... [2018-02-04 04:18:10,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10" (1/1) ... [2018-02-04 04:18:10,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10" (1/1) ... [2018-02-04 04:18:10,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 04:18:10,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 04:18:10,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 04:18:10,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 04:18:10,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 04:18:10,457 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 04:18:10,457 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 04:18:10,457 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 04:18:10,457 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 04:18:10,457 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 04:18:10,458 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 04:18:10,572 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 04:18:10,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:18:10 BoogieIcfgContainer [2018-02-04 04:18:10,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 04:18:10,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 04:18:10,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 04:18:10,575 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 04:18:10,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:18:10" (1/3) ... [2018-02-04 04:18:10,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536e7a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:18:10, skipping insertion in model container [2018-02-04 04:18:10,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:18:10" (2/3) ... [2018-02-04 04:18:10,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536e7a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:18:10, skipping insertion in model container [2018-02-04 04:18:10,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:18:10" (3/3) ... [2018-02-04 04:18:10,578 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-04 04:18:10,584 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 04:18:10,589 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 04:18:10,627 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 04:18:10,627 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 04:18:10,627 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 04:18:10,627 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 04:18:10,628 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 04:18:10,628 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 04:18:10,628 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 04:18:10,628 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 04:18:10,629 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 04:18:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-04 04:18:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 04:18:10,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:10,650 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:10,651 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:10,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times [2018-02-04 04:18:10,657 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:10,658 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:10,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:10,706 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:10,706 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:10,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:18:10,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:10,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 04:18:10,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 04:18:10,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 04:18:10,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:18:10,815 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-02-04 04:18:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:10,923 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-04 04:18:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 04:18:10,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 04:18:10,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:10,973 INFO L225 Difference]: With dead ends: 42 [2018-02-04 04:18:10,973 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 04:18:10,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 04:18:10,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 04:18:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-04 04:18:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 04:18:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-04 04:18:10,999 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2018-02-04 04:18:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:10,999 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-04 04:18:11,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 04:18:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-04 04:18:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 04:18:11,001 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:11,001 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:11,001 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:11,001 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times [2018-02-04 04:18:11,001 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:11,001 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:11,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,002 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:18:11,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:11,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 04:18:11,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:18:11,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:18:11,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:18:11,056 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-02-04 04:18:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:11,086 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-02-04 04:18:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:18:11,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 04:18:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:11,087 INFO L225 Difference]: With dead ends: 40 [2018-02-04 04:18:11,087 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 04:18:11,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:18:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 04:18:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-02-04 04:18:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 04:18:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 04:18:11,092 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-02-04 04:18:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:11,092 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 04:18:11,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:18:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 04:18:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 04:18:11,093 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:11,093 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:11,094 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times [2018-02-04 04:18:11,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:11,094 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:11,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,095 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 04:18:11,140 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:11,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:18:11,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:18:11,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:18:11,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:18:11,141 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-04 04:18:11,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:11,150 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 04:18:11,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:18:11,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 04:18:11,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:11,151 INFO L225 Difference]: With dead ends: 32 [2018-02-04 04:18:11,151 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 04:18:11,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:18:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 04:18:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-02-04 04:18:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 04:18:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-04 04:18:11,154 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-02-04 04:18:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:11,154 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-04 04:18:11,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:18:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-04 04:18:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 04:18:11,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:11,155 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:11,155 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:11,155 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times [2018-02-04 04:18:11,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:11,155 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:11,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,156 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,156 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 04:18:11,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:11,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 04:18:11,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 04:18:11,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 04:18:11,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:18:11,192 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-02-04 04:18:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:11,208 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 04:18:11,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 04:18:11,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 04:18:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:11,210 INFO L225 Difference]: With dead ends: 36 [2018-02-04 04:18:11,210 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 04:18:11,210 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 04:18:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 04:18:11,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-04 04:18:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 04:18:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-04 04:18:11,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-02-04 04:18:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:11,213 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-04 04:18:11,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 04:18:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-04 04:18:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 04:18:11,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:11,214 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:11,214 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times [2018-02-04 04:18:11,214 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:11,214 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:11,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,215 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 04:18:11,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:18:11,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:18:11,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:18:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 04:18:11,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:18:11,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-02-04 04:18:11,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 04:18:11,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 04:18:11,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:18:11,326 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-02-04 04:18:11,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:11,341 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-02-04 04:18:11,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:18:11,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 04:18:11,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:11,342 INFO L225 Difference]: With dead ends: 33 [2018-02-04 04:18:11,343 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 04:18:11,343 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 04:18:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 04:18:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 04:18:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 04:18:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 04:18:11,346 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-02-04 04:18:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:11,347 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 04:18:11,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 04:18:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 04:18:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:18:11,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:11,348 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] [2018-02-04 04:18:11,348 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times [2018-02-04 04:18:11,348 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:11,348 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:11,349 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,349 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 04:18:11,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:18:11,402 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:18:11,403 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:18:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 04:18:11,439 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:18:11,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-04 04:18:11,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:18:11,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:18:11,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:18:11,440 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-04 04:18:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:11,459 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 04:18:11,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:18:11,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 04:18:11,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:11,460 INFO L225 Difference]: With dead ends: 30 [2018-02-04 04:18:11,461 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 04:18:11,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:18:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 04:18:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 04:18:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 04:18:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 04:18:11,464 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-02-04 04:18:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:11,464 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 04:18:11,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:18:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 04:18:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 04:18:11,465 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:11,465 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] [2018-02-04 04:18:11,465 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times [2018-02-04 04:18:11,466 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:11,466 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:11,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,467 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,467 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:18:11,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 04:18:11,556 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 04:18:11,557 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 04:18:11,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 04:18:11,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 04:18:11,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 04:18:11,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 04:18:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 04:18:11,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 04:18:11,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-02-04 04:18:11,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 04:18:11,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 04:18:11,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 04:18:11,623 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-02-04 04:18:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:11,687 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-02-04 04:18:11,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 04:18:11,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 04:18:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:11,688 INFO L225 Difference]: With dead ends: 31 [2018-02-04 04:18:11,688 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 04:18:11,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 04:18:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 04:18:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 04:18:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 04:18:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 04:18:11,692 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-02-04 04:18:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:11,692 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 04:18:11,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 04:18:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 04:18:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:18:11,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:11,693 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:11,693 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341786, now seen corresponding path program 1 times [2018-02-04 04:18:11,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:11,694 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:11,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,695 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:18:11,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:11,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:18:11,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:18:11,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:18:11,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:18:11,730 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-04 04:18:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:11,742 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 04:18:11,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 04:18:11,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 04:18:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:11,743 INFO L225 Difference]: With dead ends: 30 [2018-02-04 04:18:11,743 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 04:18:11,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:18:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 04:18:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 04:18:11,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 04:18:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 04:18:11,746 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-02-04 04:18:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:11,747 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 04:18:11,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:18:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 04:18:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 04:18:11,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:11,748 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:11,748 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341785, now seen corresponding path program 1 times [2018-02-04 04:18:11,748 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:11,748 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:11,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,749 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,749 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 04:18:11,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 04:18:11,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 04:18:11,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 04:18:11,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 04:18:11,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 04:18:11,779 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-02-04 04:18:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 04:18:11,817 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-04 04:18:11,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 04:18:11,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 04:18:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 04:18:11,818 INFO L225 Difference]: With dead ends: 29 [2018-02-04 04:18:11,818 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 04:18:11,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 04:18:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 04:18:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 04:18:11,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 04:18:11,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-04 04:18:11,821 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-02-04 04:18:11,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 04:18:11,821 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-04 04:18:11,821 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 04:18:11,821 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-04 04:18:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 04:18:11,822 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 04:18:11,822 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 04:18:11,822 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 04:18:11,822 INFO L82 PathProgramCache]: Analyzing trace with hash -240987817, now seen corresponding path program 1 times [2018-02-04 04:18:11,822 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 04:18:11,822 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 04:18:11,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,823 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 04:18:11,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 04:18:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 04:18:11,832 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 04:18:11,838 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 04:18:11,842 INFO L168 Benchmark]: Toolchain (without parser) took 1617.49 ms. Allocated memory was 402.1 MB in the beginning and 608.7 MB in the end (delta: 206.6 MB). Free memory was 359.0 MB in the beginning and 438.0 MB in the end (delta: -79.0 MB). Peak memory consumption was 127.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:11,843 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 364.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 04:18:11,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.81 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 345.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:11,843 INFO L168 Benchmark]: Boogie Preprocessor took 21.11 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 343.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:11,843 INFO L168 Benchmark]: RCFGBuilder took 153.22 ms. Allocated memory is still 402.1 MB. Free memory was 343.1 MB in the beginning and 329.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:11,843 INFO L168 Benchmark]: TraceAbstraction took 1268.23 ms. Allocated memory was 402.1 MB in the beginning and 608.7 MB in the end (delta: 206.6 MB). Free memory was 329.1 MB in the beginning and 438.0 MB in the end (delta: -108.9 MB). Peak memory consumption was 97.7 MB. Max. memory is 5.3 GB. [2018-02-04 04:18:11,844 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 364.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 171.81 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 345.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.11 ms. Allocated memory is still 402.1 MB. Free memory was 345.8 MB in the beginning and 343.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 153.22 ms. Allocated memory is still 402.1 MB. Free memory was 343.1 MB in the beginning and 329.1 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1268.23 ms. Allocated memory was 402.1 MB in the beginning and 608.7 MB in the end (delta: 206.6 MB). Free memory was 329.1 MB in the beginning and 438.0 MB in the end (delta: -108.9 MB). Peak memory consumption was 97.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_04-18-11-849.csv Received shutdown request...