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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 22:33:11,190 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:33:11,191 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:33:11,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:33:11,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:33:11,208 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:33:11,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:33:11,211 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:33:11,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:33:11,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:33:11,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:33:11,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:33:11,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:33:11,217 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:33:11,218 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:33:11,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:33:11,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:33:11,225 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:33:11,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:33:11,228 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:33:11,230 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:33:11,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:33:11,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:33:11,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:33:11,232 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:33:11,234 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:33:11,234 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:33:11,235 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:33:11,235 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:33:11,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:33:11,236 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:33:11,236 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 22:33:11,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:33:11,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:33:11,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:33:11,246 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:33:11,246 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:33:11,246 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:33:11,246 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:33:11,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:33:11,247 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:33:11,247 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:33:11,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:33:11,247 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:33:11,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:33:11,247 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:33:11,247 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:33:11,248 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:33:11,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:33:11,248 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:33:11,248 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:33:11,248 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:33:11,248 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:33:11,248 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:33:11,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:33:11,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:33:11,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:33:11,249 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:33:11,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:33:11,250 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:33:11,250 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:33:11,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:33:11,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:33:11,250 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:33:11,251 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:33:11,251 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:33:11,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:33:11,295 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:33:11,298 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:33:11,300 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:33:11,300 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:33:11,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test7_false-valid-memtrack_true-termination.i [2018-01-28 22:33:11,511 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:33:11,515 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:33:11,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:33:11,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:33:11,521 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:33:11,522 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:33:11" (1/1) ... [2018-01-28 22:33:11,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca3c60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11, skipping insertion in model container [2018-01-28 22:33:11,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:33:11" (1/1) ... [2018-01-28 22:33:11,537 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:33:11,585 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:33:11,702 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:33:11,724 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:33:11,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11 WrapperNode [2018-01-28 22:33:11,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:33:11,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:33:11,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:33:11,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:33:11,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11" (1/1) ... [2018-01-28 22:33:11,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11" (1/1) ... [2018-01-28 22:33:11,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11" (1/1) ... [2018-01-28 22:33:11,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11" (1/1) ... [2018-01-28 22:33:11,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11" (1/1) ... [2018-01-28 22:33:11,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11" (1/1) ... [2018-01-28 22:33:11,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11" (1/1) ... [2018-01-28 22:33:11,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:33:11,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:33:11,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:33:11,770 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:33:11,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11" (1/1) ... No working directory specified, using /storage/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-01-28 22:33:11,817 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:33:11,817 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:33:11,817 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-28 22:33:11,817 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-28 22:33:11,817 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-28 22:33:11,817 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-28 22:33:11,817 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-28 22:33:11,818 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-28 22:33:11,818 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:33:11,818 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:33:11,818 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:33:11,818 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:33:11,818 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:33:11,819 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:33:11,819 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:33:11,819 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:33:11,819 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:33:11,819 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-28 22:33:11,819 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-28 22:33:11,820 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-28 22:33:11,820 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-28 22:33:11,820 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-28 22:33:11,820 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-28 22:33:11,820 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:33:11,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:33:11,821 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:33:12,047 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:33:12,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:33:12 BoogieIcfgContainer [2018-01-28 22:33:12,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:33:12,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:33:12,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:33:12,052 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:33:12,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:33:11" (1/3) ... [2018-01-28 22:33:12,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ccdfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:33:12, skipping insertion in model container [2018-01-28 22:33:12,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:33:11" (2/3) ... [2018-01-28 22:33:12,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ccdfe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:33:12, skipping insertion in model container [2018-01-28 22:33:12,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:33:12" (3/3) ... [2018-01-28 22:33:12,054 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test7_false-valid-memtrack_true-termination.i [2018-01-28 22:33:12,061 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:33:12,066 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-28 22:33:12,105 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:33:12,105 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:33:12,105 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:33:12,105 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:33:12,106 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:33:12,106 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:33:12,106 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:33:12,106 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:33:12,107 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:33:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-28 22:33:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 22:33:12,133 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:12,134 INFO L330 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] [2018-01-28 22:33:12,135 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:12,139 INFO L82 PathProgramCache]: Analyzing trace with hash -160345570, now seen corresponding path program 1 times [2018-01-28 22:33:12,140 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:12,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:12,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:12,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:12,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:12,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:12,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:12,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:12,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:33:12,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:33:12,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:33:12,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:33:12,500 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 5 states. [2018-01-28 22:33:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:12,606 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-01-28 22:33:12,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:33:12,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-28 22:33:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:12,621 INFO L225 Difference]: With dead ends: 98 [2018-01-28 22:33:12,621 INFO L226 Difference]: Without dead ends: 94 [2018-01-28 22:33:12,624 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:33:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-28 22:33:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2018-01-28 22:33:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-28 22:33:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-01-28 22:33:12,669 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 33 [2018-01-28 22:33:12,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:12,670 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-01-28 22:33:12,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:33:12,671 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-01-28 22:33:12,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-28 22:33:12,672 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:12,673 INFO L330 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] [2018-01-28 22:33:12,673 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash -160345571, now seen corresponding path program 1 times [2018-01-28 22:33:12,673 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:12,673 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:12,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:12,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:12,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:12,698 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:12,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:12,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:33:12,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:33:12,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:33:12,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:33:12,777 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 5 states. [2018-01-28 22:33:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:12,862 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-01-28 22:33:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:33:12,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-28 22:33:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:12,864 INFO L225 Difference]: With dead ends: 93 [2018-01-28 22:33:12,865 INFO L226 Difference]: Without dead ends: 92 [2018-01-28 22:33:12,866 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:33:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-28 22:33:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2018-01-28 22:33:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-28 22:33:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-01-28 22:33:12,879 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 33 [2018-01-28 22:33:12,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:12,879 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-01-28 22:33:12,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:33:12,879 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-01-28 22:33:12,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:33:12,881 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:12,881 INFO L330 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] [2018-01-28 22:33:12,881 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:12,882 INFO L82 PathProgramCache]: Analyzing trace with hash 88767254, now seen corresponding path program 1 times [2018-01-28 22:33:12,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:12,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:12,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:12,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:12,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:12,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:12,974 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:12,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:33:12,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:33:12,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:33:12,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:33:12,975 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 6 states. [2018-01-28 22:33:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:13,135 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-01-28 22:33:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:33:13,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-28 22:33:13,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:13,138 INFO L225 Difference]: With dead ends: 93 [2018-01-28 22:33:13,138 INFO L226 Difference]: Without dead ends: 92 [2018-01-28 22:33:13,138 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:33:13,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-28 22:33:13,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-01-28 22:33:13,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-28 22:33:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-01-28 22:33:13,150 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 34 [2018-01-28 22:33:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:13,150 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-01-28 22:33:13,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:33:13,151 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-01-28 22:33:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:33:13,152 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:13,153 INFO L330 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] [2018-01-28 22:33:13,153 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash 88767253, now seen corresponding path program 1 times [2018-01-28 22:33:13,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:13,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:13,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:13,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:13,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:13,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:13,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:13,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:33:13,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:33:13,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:33:13,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:33:13,240 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 6 states. [2018-01-28 22:33:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:13,310 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-01-28 22:33:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 22:33:13,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-28 22:33:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:13,312 INFO L225 Difference]: With dead ends: 85 [2018-01-28 22:33:13,312 INFO L226 Difference]: Without dead ends: 84 [2018-01-28 22:33:13,312 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:33:13,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-28 22:33:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 68. [2018-01-28 22:33:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-28 22:33:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-01-28 22:33:13,321 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 34 [2018-01-28 22:33:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:13,321 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-01-28 22:33:13,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:33:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-01-28 22:33:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 22:33:13,323 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:13,323 INFO L330 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] [2018-01-28 22:33:13,323 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1974958590, now seen corresponding path program 1 times [2018-01-28 22:33:13,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:13,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:13,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:13,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:13,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:13,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:13,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:13,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:33:13,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:33:13,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:33:13,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:33:13,426 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-01-28 22:33:13,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:13,560 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2018-01-28 22:33:13,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:33:13,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-01-28 22:33:13,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:13,597 INFO L225 Difference]: With dead ends: 102 [2018-01-28 22:33:13,598 INFO L226 Difference]: Without dead ends: 87 [2018-01-28 22:33:13,598 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:33:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-28 22:33:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-01-28 22:33:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-28 22:33:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2018-01-28 22:33:13,609 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 34 [2018-01-28 22:33:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:13,610 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2018-01-28 22:33:13,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:33:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2018-01-28 22:33:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-28 22:33:13,611 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:13,611 INFO L330 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-01-28 22:33:13,611 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1452571658, now seen corresponding path program 1 times [2018-01-28 22:33:13,612 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:13,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:13,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:13,613 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:13,613 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:13,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:13,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:13,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:33:13,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:33:13,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:33:13,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:33:13,691 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 6 states. [2018-01-28 22:33:13,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:13,792 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-28 22:33:13,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:33:13,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-28 22:33:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:13,794 INFO L225 Difference]: With dead ends: 106 [2018-01-28 22:33:13,794 INFO L226 Difference]: Without dead ends: 89 [2018-01-28 22:33:13,795 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:33:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-28 22:33:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-01-28 22:33:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 22:33:13,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-28 22:33:13,807 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 35 [2018-01-28 22:33:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:13,808 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-28 22:33:13,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:33:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-28 22:33:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 22:33:13,810 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:13,810 INFO L330 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] [2018-01-28 22:33:13,810 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:13,810 INFO L82 PathProgramCache]: Analyzing trace with hash 562608850, now seen corresponding path program 1 times [2018-01-28 22:33:13,811 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:13,811 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:13,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:13,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:13,812 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:13,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:13,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:13,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:33:13,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:33:13,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:33:13,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:33:13,896 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 5 states. [2018-01-28 22:33:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:13,920 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-01-28 22:33:13,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:33:13,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-28 22:33:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:13,922 INFO L225 Difference]: With dead ends: 113 [2018-01-28 22:33:13,922 INFO L226 Difference]: Without dead ends: 65 [2018-01-28 22:33:13,922 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:33:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-28 22:33:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-28 22:33:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-28 22:33:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-01-28 22:33:13,930 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 43 [2018-01-28 22:33:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:13,931 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-01-28 22:33:13,931 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:33:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-01-28 22:33:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 22:33:13,932 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:13,932 INFO L330 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] [2018-01-28 22:33:13,933 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash 782044618, now seen corresponding path program 1 times [2018-01-28 22:33:13,933 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:13,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:13,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:13,934 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:13,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:13,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:14,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:14,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:33:14,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:33:14,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:33:14,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:33:14,079 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 8 states. [2018-01-28 22:33:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:14,342 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-01-28 22:33:14,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:33:14,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-01-28 22:33:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:14,343 INFO L225 Difference]: With dead ends: 73 [2018-01-28 22:33:14,343 INFO L226 Difference]: Without dead ends: 72 [2018-01-28 22:33:14,344 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:33:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-28 22:33:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-01-28 22:33:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-28 22:33:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-01-28 22:33:14,352 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 44 [2018-01-28 22:33:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:14,352 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-01-28 22:33:14,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:33:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-01-28 22:33:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 22:33:14,353 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:14,353 INFO L330 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] [2018-01-28 22:33:14,353 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash 782044619, now seen corresponding path program 1 times [2018-01-28 22:33:14,354 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:14,354 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:14,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:14,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:14,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:14,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:14,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:14,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:33:14,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:33:14,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:33:14,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:33:14,541 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 9 states. [2018-01-28 22:33:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:14,835 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-01-28 22:33:14,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:33:14,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-01-28 22:33:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:14,837 INFO L225 Difference]: With dead ends: 66 [2018-01-28 22:33:14,837 INFO L226 Difference]: Without dead ends: 65 [2018-01-28 22:33:14,837 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:33:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-28 22:33:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-01-28 22:33:14,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-28 22:33:14,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-01-28 22:33:14,848 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 44 [2018-01-28 22:33:14,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:14,849 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-01-28 22:33:14,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:33:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-01-28 22:33:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 22:33:14,850 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:14,850 INFO L330 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, 1] [2018-01-28 22:33:14,850 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:14,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1804373262, now seen corresponding path program 1 times [2018-01-28 22:33:14,851 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:14,851 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:14,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:14,852 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:14,852 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:14,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:15,166 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:15,166 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:33:15,166 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:33:15,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:33:15,167 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:33:15,167 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 9 states. [2018-01-28 22:33:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:15,409 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-28 22:33:15,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:33:15,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-01-28 22:33:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:15,410 INFO L225 Difference]: With dead ends: 76 [2018-01-28 22:33:15,410 INFO L226 Difference]: Without dead ends: 61 [2018-01-28 22:33:15,410 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:33:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-28 22:33:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-28 22:33:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-28 22:33:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-01-28 22:33:15,416 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 46 [2018-01-28 22:33:15,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:15,416 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-01-28 22:33:15,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:33:15,416 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-01-28 22:33:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-28 22:33:15,417 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:15,417 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:33:15,417 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:15,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1735467719, now seen corresponding path program 1 times [2018-01-28 22:33:15,418 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:15,418 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:15,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:15,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:15,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:33:15,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:33:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:33:15,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:33:15,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:33:15,464 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:33:15,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:33:15,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:33:15,465 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2018-01-28 22:33:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:33:15,488 INFO L93 Difference]: Finished difference Result 67 states and 66 transitions. [2018-01-28 22:33:15,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:33:15,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-28 22:33:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:33:15,490 INFO L225 Difference]: With dead ends: 67 [2018-01-28 22:33:15,490 INFO L226 Difference]: Without dead ends: 61 [2018-01-28 22:33:15,490 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:33:15,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-28 22:33:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-28 22:33:15,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-28 22:33:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2018-01-28 22:33:15,498 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 56 [2018-01-28 22:33:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:33:15,499 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2018-01-28 22:33:15,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:33:15,499 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2018-01-28 22:33:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-28 22:33:15,500 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:33:15,500 INFO L330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:33:15,500 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-28 22:33:15,500 INFO L82 PathProgramCache]: Analyzing trace with hash 720686570, now seen corresponding path program 1 times [2018-01-28 22:33:15,500 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:33:15,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:33:15,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:15,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:33:15,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:33:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 22:33:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 22:33:15,554 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 22:33:15,575 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-28 22:33:15,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:33:15 BoogieIcfgContainer [2018-01-28 22:33:15,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 22:33:15,592 INFO L168 Benchmark]: Toolchain (without parser) took 4080.48 ms. Allocated memory was 303.0 MB in the beginning and 513.3 MB in the end (delta: 210.2 MB). Free memory was 262.1 MB in the beginning and 351.5 MB in the end (delta: -89.4 MB). Peak memory consumption was 120.8 MB. Max. memory is 5.3 GB. [2018-01-28 22:33:15,593 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:33:15,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.12 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 249.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:33:15,593 INFO L168 Benchmark]: Boogie Preprocessor took 34.70 ms. Allocated memory is still 303.0 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:33:15,594 INFO L168 Benchmark]: RCFGBuilder took 279.21 ms. Allocated memory is still 303.0 MB. Free memory was 247.0 MB in the beginning and 227.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-28 22:33:15,594 INFO L168 Benchmark]: TraceAbstraction took 3542.07 ms. Allocated memory was 303.0 MB in the beginning and 513.3 MB in the end (delta: 210.2 MB). Free memory was 227.5 MB in the beginning and 351.5 MB in the end (delta: -124.0 MB). Peak memory consumption was 86.2 MB. Max. memory is 5.3 GB. [2018-01-28 22:33:15,596 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.21 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.12 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 249.0 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.70 ms. Allocated memory is still 303.0 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 279.21 ms. Allocated memory is still 303.0 MB. Free memory was 247.0 MB in the beginning and 227.5 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3542.07 ms. Allocated memory was 303.0 MB in the beginning and 513.3 MB in the end (delta: 210.2 MB). Free memory was 227.5 MB in the beginning and 351.5 MB in the end (delta: -124.0 MB). Peak memory consumption was 86.2 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: - UnprovableResult [Line: 1473]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1473. Possible FailurePath: [L1474] CALL entry_point() [L1466] FCALL struct A a7; VAL [a7={6:0}] [L1467] CALL, EXPR probe1_6(&a7) VAL [a={6:0}] [L1443] int ret = - -3; VAL [a={6:0}, a={6:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, malloc(size)={7:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={7:0}, malloc(size)={7:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={6:0}, a={6:0}, ldv_malloc(sizeof(int))={7:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); VAL [a={6:0}, a={6:0}, ldv_malloc(sizeof(int))={7:0}, p={7:0}, ret=3] [L1445] COND FALSE !(p==0) VAL [a={6:0}, a={6:0}, p={7:0}, ret=3] [L1447] CALL, EXPR f6() [L1435] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0] [L1447] EXPR f6() VAL [a={6:0}, a={6:0}, f6()=0, p={7:0}, ret=3] [L1447] ret = f6() VAL [a={6:0}, a={6:0}, f6()=0, p={7:0}, ret=0] [L1448] COND FALSE !(ret<0) VAL [a={6:0}, a={6:0}, p={7:0}, ret=0] [L1450] CALL, EXPR g6() [L1439] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0] [L1450] EXPR g6() VAL [a={6:0}, a={6:0}, g6()=0, p={7:0}, ret=0] [L1450] ret = g6() VAL [a={6:0}, a={6:0}, g6()=0, p={7:0}, ret=0] [L1451] COND FALSE !(ret<0) VAL [a={6:0}, a={6:0}, p={7:0}, ret=0] [L1453] FCALL a->p = p VAL [a={6:0}, a={6:0}, p={7:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={6:0}, a={6:0}, p={7:0}, ret=0] [L1467] EXPR probe1_6(&a7) VAL [a7={6:0}, probe1_6(&a7)=0] [L1467] int ret = probe1_6(&a7); VAL [a7={6:0}, probe1_6(&a7)=0, ret=0] [L1468] COND TRUE ret==0 VAL [a7={6:0}, ret=0] [L1469] RET, FCALL disconnect_2_6(&a7) VAL [a7={6:0}, ret=0] [L1474] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 73 locations, 5 error locations. UNSAFE Result, 3.4s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 754 SDtfs, 269 SDslu, 2237 SDs, 0 SdLazy, 803 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 56 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 425 ConstructedInterpolants, 0 QuantifiedInterpolants, 66445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_22-33-15-605.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test7_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_22-33-15-605.csv Received shutdown request...