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_test7_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:15:00,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:15:00,041 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:15:00,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:15:00,054 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:15:00,055 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:15:00,056 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:15:00,058 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:15:00,059 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:15:00,060 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:15:00,061 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:15:00,061 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:15:00,062 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:15:00,063 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:15:00,064 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:15:00,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:15:00,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:15:00,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:15:00,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:15:00,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:15:00,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:15:00,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:15:00,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:15:00,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:15:00,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:15:00,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:15:00,076 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:15:00,077 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:15:00,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:15:00,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:15:00,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:15:00,077 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 19:15:00,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:15:00,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:15:00,088 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:15:00,088 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:15:00,088 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:15:00,089 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:15:00,089 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:15:00,089 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:15:00,089 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:15:00,089 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:15:00,089 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:15:00,090 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:15:00,090 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:15:00,090 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:15:00,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:15:00,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:15:00,090 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:15:00,090 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:15:00,090 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:15:00,090 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:15:00,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:15:00,091 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:15:00,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:15:00,091 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:15:00,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:15:00,126 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:15:00,129 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:15:00,130 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:15:00,130 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:15:00,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i [2018-02-04 19:15:00,272 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:15:00,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:15:00,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:15:00,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:15:00,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:15:00,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:15:00" (1/1) ... [2018-02-04 19:15:00,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581e1694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00, skipping insertion in model container [2018-02-04 19:15:00,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:15:00" (1/1) ... [2018-02-04 19:15:00,292 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:15:00,325 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:15:00,409 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:15:00,423 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:15:00,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00 WrapperNode [2018-02-04 19:15:00,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:15:00,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:15:00,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:15:00,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:15:00,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00" (1/1) ... [2018-02-04 19:15:00,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00" (1/1) ... [2018-02-04 19:15:00,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00" (1/1) ... [2018-02-04 19:15:00,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00" (1/1) ... [2018-02-04 19:15:00,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00" (1/1) ... [2018-02-04 19:15:00,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00" (1/1) ... [2018-02-04 19:15:00,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00" (1/1) ... [2018-02-04 19:15:00,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:15:00,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:15:00,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:15:00,455 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:15:00,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00" (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 19:15:00,489 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:15:00,489 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:15:00,490 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:15:00,490 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-02-04 19:15:00,490 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-02-04 19:15:00,490 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-02-04 19:15:00,490 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-02-04 19:15:00,490 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:15:00,490 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:15:00,490 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:15:00,490 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:15:00,490 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:15:00,490 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:15:00,490 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:15:00,491 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:15:00,654 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:15:00,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:15:00 BoogieIcfgContainer [2018-02-04 19:15:00,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:15:00,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:15:00,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:15:00,657 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:15:00,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:15:00" (1/3) ... [2018-02-04 19:15:00,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d1ed2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:15:00, skipping insertion in model container [2018-02-04 19:15:00,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:15:00" (2/3) ... [2018-02-04 19:15:00,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64d1ed2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:15:00, skipping insertion in model container [2018-02-04 19:15:00,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:15:00" (3/3) ... [2018-02-04 19:15:00,660 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test7_false-valid-memtrack_true-termination.i [2018-02-04 19:15:00,665 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:15:00,669 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 19:15:00,699 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:15:00,699 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:15:00,700 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:15:00,700 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:15:00,700 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:15:00,700 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:15:00,700 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:15:00,700 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:15:00,701 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:15:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-04 19:15:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:15:00,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:15:00,721 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-04 19:15:00,722 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:15:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2071706780, now seen corresponding path program 1 times [2018-02-04 19:15:00,727 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:15:00,728 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:15:00,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:00,778 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:00,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:00,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:15:00,944 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 19:15:00,947 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:15:00,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:15:00,949 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:15:00,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:15:00,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:15:00,959 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-02-04 19:15:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:15:01,032 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-02-04 19:15:01,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:15:01,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-04 19:15:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:15:01,042 INFO L225 Difference]: With dead ends: 61 [2018-02-04 19:15:01,042 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 19:15:01,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:15:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 19:15:01,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-02-04 19:15:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 19:15:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-04 19:15:01,068 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 23 [2018-02-04 19:15:01,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:15:01,068 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-04 19:15:01,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:15:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-04 19:15:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:15:01,069 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:15:01,070 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:15:01,070 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:15:01,070 INFO L82 PathProgramCache]: Analyzing trace with hash -776458562, now seen corresponding path program 1 times [2018-02-04 19:15:01,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:15:01,070 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:15:01,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:01,072 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:01,072 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:01,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:15:01,148 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 19:15:01,149 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:15:01,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:15:01,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:15:01,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:15:01,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:15:01,151 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-02-04 19:15:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:15:01,184 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-02-04 19:15:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:15:01,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 19:15:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:15:01,186 INFO L225 Difference]: With dead ends: 55 [2018-02-04 19:15:01,186 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 19:15:01,187 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 19:15:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 19:15:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 19:15:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 19:15:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-02-04 19:15:01,192 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 25 [2018-02-04 19:15:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:15:01,192 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-02-04 19:15:01,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:15:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-02-04 19:15:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:15:01,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:15:01,193 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:15:01,193 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:15:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash -776458561, now seen corresponding path program 1 times [2018-02-04 19:15:01,193 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:15:01,193 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:15:01,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:01,194 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:01,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:01,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:15:01,248 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 19:15:01,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:15:01,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:15:01,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:15:01,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:15:01,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:15:01,249 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-02-04 19:15:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:15:01,325 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-02-04 19:15:01,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:15:01,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 19:15:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:15:01,326 INFO L225 Difference]: With dead ends: 56 [2018-02-04 19:15:01,326 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 19:15:01,327 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 19:15:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 19:15:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-02-04 19:15:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 19:15:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-02-04 19:15:01,330 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 25 [2018-02-04 19:15:01,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:15:01,330 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-02-04 19:15:01,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:15:01,330 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-02-04 19:15:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:15:01,330 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:15:01,330 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:15:01,330 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:15:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1521421354, now seen corresponding path program 1 times [2018-02-04 19:15:01,331 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:15:01,331 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:15:01,331 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:01,332 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:01,332 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:01,342 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:15:01,346 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:15:01,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:15:01,346 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:15:01,347 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:01,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:15:01,427 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 19:15:01,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:15:01,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:15:01,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:15:01,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:15:01,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2018-02-04 19:15:01,428 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 5 states. [2018-02-04 19:15:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:15:01,598 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 19:15:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:15:01,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-04 19:15:01,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:15:01,599 INFO L225 Difference]: With dead ends: 64 [2018-02-04 19:15:01,599 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 19:15:01,599 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=11, Unknown=1, NotChecked=0, Total=20 [2018-02-04 19:15:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 19:15:01,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 19:15:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 19:15:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-04 19:15:01,605 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 25 [2018-02-04 19:15:01,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:15:01,605 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-04 19:15:01,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:15:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-04 19:15:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:15:01,606 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:15:01,606 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:15:01,606 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:15:01,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1580819832, now seen corresponding path program 1 times [2018-02-04 19:15:01,607 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:15:01,607 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:15:01,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:01,608 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:01,608 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:01,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:15:01,651 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 19:15:01,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:15:01,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:15:01,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:15:01,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:15:01,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:15:01,653 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 6 states. [2018-02-04 19:15:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:15:01,702 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-02-04 19:15:01,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:15:01,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 19:15:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:15:01,704 INFO L225 Difference]: With dead ends: 50 [2018-02-04 19:15:01,704 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 19:15:01,704 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 19:15:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 19:15:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 19:15:01,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 19:15:01,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-02-04 19:15:01,708 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 27 [2018-02-04 19:15:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:15:01,708 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-02-04 19:15:01,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:15:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-02-04 19:15:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 19:15:01,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:15:01,709 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:15:01,709 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:15:01,709 INFO L82 PathProgramCache]: Analyzing trace with hash -693357389, now seen corresponding path program 1 times [2018-02-04 19:15:01,709 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:15:01,709 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:15:01,710 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:01,710 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:01,710 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:01,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:15:01,725 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:15:01,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:15:01,725 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:15:01,726 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:01,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:15:01,764 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 19:15:01,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:15:01,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:15:01,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:15:01,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:15:01,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:15:01,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 19:15:01,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:15:01,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:15:01,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 19:15:01,915 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 19:15:01,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:15:01,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:15:01,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:15:01,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:15:01,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:15:01,917 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 9 states. [2018-02-04 19:15:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:15:02,088 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-02-04 19:15:02,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:15:02,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 19:15:02,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:15:02,089 INFO L225 Difference]: With dead ends: 58 [2018-02-04 19:15:02,089 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 19:15:02,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-02-04 19:15:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 19:15:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-02-04 19:15:02,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 19:15:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-02-04 19:15:02,095 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 31 [2018-02-04 19:15:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:15:02,095 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-02-04 19:15:02,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:15:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-02-04 19:15:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 19:15:02,096 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:15:02,096 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:15:02,096 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:15:02,096 INFO L82 PathProgramCache]: Analyzing trace with hash -693357388, now seen corresponding path program 1 times [2018-02-04 19:15:02,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:15:02,096 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:15:02,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:02,097 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:02,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:02,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:15:02,119 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:15:02,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:15:02,119 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:15:02,120 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:02,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:15:02,153 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 19:15:02,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:15:02,160 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 19:15:02,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:15:02,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:15:02,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 19:15:02,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:15:02,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 19:15:02,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:15:02,358 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:15:02,359 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:15:02,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 19:15:02,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:15:02,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 19:15:02,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 19:15:02,467 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 19:15:02,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:15:02,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:15:02,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:15:02,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:15:02,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:15:02,468 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 10 states. [2018-02-04 19:15:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:15:03,745 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-02-04 19:15:03,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:15:03,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-04 19:15:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:15:03,746 INFO L225 Difference]: With dead ends: 50 [2018-02-04 19:15:03,746 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 19:15:03,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=38, Invalid=140, Unknown=4, NotChecked=0, Total=182 [2018-02-04 19:15:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 19:15:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-02-04 19:15:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 19:15:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-02-04 19:15:03,748 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 31 [2018-02-04 19:15:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:15:03,749 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-02-04 19:15:03,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:15:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-02-04 19:15:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 19:15:03,750 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:15:03,750 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:15:03,750 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:15:03,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1580514095, now seen corresponding path program 1 times [2018-02-04 19:15:03,750 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:15:03,750 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:15:03,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:03,751 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:03,751 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:03,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:15:03,764 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:15:03,764 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:15:03,764 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:15:03,765 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:03,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:15:03,856 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:15:03,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-02-04 19:15:03,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:15:03,864 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:15:03,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-04 19:15:03,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:15:03,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 19:15:03,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-02-04 19:15:03,962 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 19:15:03,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:15:03,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 19:15:03,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 19:15:03,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 19:15:03,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=114, Unknown=7, NotChecked=0, Total=156 [2018-02-04 19:15:03,963 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 13 states. [2018-02-04 19:15:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:15:04,229 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-02-04 19:15:04,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 19:15:04,229 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-02-04 19:15:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:15:04,229 INFO L225 Difference]: With dead ends: 61 [2018-02-04 19:15:04,230 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 19:15:04,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=183, Unknown=7, NotChecked=0, Total=240 [2018-02-04 19:15:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 19:15:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 19:15:04,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 19:15:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-04 19:15:04,232 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 35 [2018-02-04 19:15:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:15:04,232 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-04 19:15:04,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 19:15:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-04 19:15:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 19:15:04,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:15:04,233 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:15:04,233 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:15:04,233 INFO L82 PathProgramCache]: Analyzing trace with hash 720787466, now seen corresponding path program 1 times [2018-02-04 19:15:04,233 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:15:04,233 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:15:04,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:04,234 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:04,234 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:15:04,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:15:04,264 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 19:15:04,265 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:15:04,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:15:04,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:15:04,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:15:04,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:15:04,266 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 5 states. [2018-02-04 19:15:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:15:04,270 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-02-04 19:15:04,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:15:04,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-02-04 19:15:04,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:15:04,271 INFO L225 Difference]: With dead ends: 46 [2018-02-04 19:15:04,271 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 19:15:04,271 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:15:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 19:15:04,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 19:15:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 19:15:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2018-02-04 19:15:04,273 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 41 [2018-02-04 19:15:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:15:04,273 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2018-02-04 19:15:04,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:15:04,273 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2018-02-04 19:15:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 19:15:04,274 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:15:04,274 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:15:04,274 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-02-04 19:15:04,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1114160435, now seen corresponding path program 1 times [2018-02-04 19:15:04,274 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:15:04,274 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:15:04,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:04,275 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:15:04,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:15:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:15:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:15:04,308 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 19:15:04,319 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 19:15:04,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:15:04 BoogieIcfgContainer [2018-02-04 19:15:04,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:15:04,332 INFO L168 Benchmark]: Toolchain (without parser) took 4059.28 ms. Allocated memory was 402.1 MB in the beginning and 627.6 MB in the end (delta: 225.4 MB). Free memory was 359.0 MB in the beginning and 433.9 MB in the end (delta: -74.9 MB). Peak memory consumption was 150.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:15:04,333 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:15:04,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.06 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 345.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:15:04,333 INFO L168 Benchmark]: Boogie Preprocessor took 25.18 ms. Allocated memory is still 402.1 MB. Free memory was 345.7 MB in the beginning and 344.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:15:04,334 INFO L168 Benchmark]: RCFGBuilder took 199.85 ms. Allocated memory is still 402.1 MB. Free memory was 344.4 MB in the beginning and 325.1 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:15:04,334 INFO L168 Benchmark]: TraceAbstraction took 3676.49 ms. Allocated memory was 402.1 MB in the beginning and 627.6 MB in the end (delta: 225.4 MB). Free memory was 325.1 MB in the beginning and 433.9 MB in the end (delta: -108.8 MB). Peak memory consumption was 116.6 MB. Max. memory is 5.3 GB. [2018-02-04 19:15:04,335 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.12 ms. Allocated memory is still 402.1 MB. Free memory is still 365.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.06 ms. Allocated memory is still 402.1 MB. Free memory was 359.0 MB in the beginning and 345.7 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.18 ms. Allocated memory is still 402.1 MB. Free memory was 345.7 MB in the beginning and 344.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 199.85 ms. Allocated memory is still 402.1 MB. Free memory was 344.4 MB in the beginning and 325.1 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3676.49 ms. Allocated memory was 402.1 MB in the beginning and 627.6 MB in the end (delta: 225.4 MB). Free memory was 325.1 MB in the beginning and 433.9 MB in the end (delta: -108.8 MB). Peak memory consumption was 116.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1473]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1474] CALL entry_point() [L1466] FCALL struct A a7; VAL [a7={7:0}] [L1467] CALL, EXPR probe1_6(&a7) VAL [a={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={6:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={6:0}, malloc(size)={6:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, ldv_malloc(sizeof(int))={6:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); [L1445] COND FALSE !(p==0) VAL [a={7:0}, a={7:0}, p={6:0}, ret=3] [L1447] CALL, EXPR f6() [L1435] RET return __VERIFIER_nondet_int(); [L1447] EXPR f6() VAL [a={7:0}, a={7:0}, f6()=0, p={6:0}, ret=3] [L1447] ret = f6() [L1448] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, p={6:0}, ret=0] [L1450] CALL, EXPR g6() [L1439] RET return __VERIFIER_nondet_int(); [L1450] EXPR g6() VAL [a={7:0}, a={7:0}, g6()=0, p={6:0}, ret=0] [L1450] ret = g6() [L1451] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, p={6:0}, ret=0] [L1453] FCALL a->p = p VAL [a={7:0}, a={7:0}, p={6:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={7:0}, a={7:0}, p={6:0}, ret=0] [L1467] EXPR probe1_6(&a7) VAL [a7={7:0}, probe1_6(&a7)=0] [L1467] int ret = probe1_6(&a7); [L1468] COND TRUE ret==0 VAL [a7={7:0}, ret=0] [L1469] RET, FCALL disconnect_2_6(&a7) VAL [a7={7:0}, ret=0] [L1474] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 55 locations, 5 error locations. UNSAFE Result, 3.6s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 425 SDtfs, 211 SDslu, 1254 SDs, 0 SdLazy, 759 SolverSat, 70 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 430 NumberOfCodeBlocks, 430 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 254 ConstructedInterpolants, 53 QuantifiedInterpolants, 49600 SizeOfPredicates, 14 NumberOfNonLiveVariables, 489 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-15-04-341.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-15-04-341.csv Received shutdown request...