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_test6_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:03:15,243 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:03:15,245 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:03:15,260 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:03:15,261 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:03:15,262 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:03:15,263 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:03:15,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:03:15,267 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:03:15,268 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:03:15,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:03:15,269 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:03:15,273 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:03:15,275 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:03:15,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:03:15,278 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:03:15,280 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:03:15,282 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:03:15,283 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:03:15,284 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:03:15,286 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:03:15,286 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:03:15,286 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:03:15,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:03:15,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:03:15,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:03:15,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:03:15,290 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:03:15,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:03:15,291 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:03:15,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:03:15,292 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-31 09:03:15,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:03:15,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:03:15,303 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:03:15,303 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:03:15,303 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:03:15,303 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:03:15,304 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:03:15,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:03:15,304 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:03:15,305 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:03:15,305 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:03:15,305 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:03:15,305 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:03:15,305 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:03:15,306 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:03:15,306 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:03:15,306 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:03:15,306 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:03:15,306 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:03:15,306 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:03:15,307 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:03:15,307 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:03:15,307 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:03:15,307 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:03:15,307 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:03:15,307 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:03:15,308 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:03:15,308 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:03:15,308 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:03:15,308 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:03:15,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:03:15,308 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:03:15,309 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:03:15,309 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:03:15,354 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:03:15,362 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:03:15,365 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:03:15,366 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:03:15,366 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:03:15,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-31 09:03:15,590 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:03:15,599 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:03:15,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:03:15,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:03:15,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:03:15,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:03:15" (1/1) ... [2018-01-31 09:03:15,616 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159fe893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15, skipping insertion in model container [2018-01-31 09:03:15,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:03:15" (1/1) ... [2018-01-31 09:03:15,635 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:03:15,712 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:03:15,896 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:03:15,923 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:03:15,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15 WrapperNode [2018-01-31 09:03:15,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:03:15,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:03:15,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:03:15,933 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:03:15,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15" (1/1) ... [2018-01-31 09:03:15,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15" (1/1) ... [2018-01-31 09:03:15,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15" (1/1) ... [2018-01-31 09:03:15,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15" (1/1) ... [2018-01-31 09:03:15,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15" (1/1) ... [2018-01-31 09:03:15,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15" (1/1) ... [2018-01-31 09:03:15,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15" (1/1) ... [2018-01-31 09:03:15,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:03:15,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:03:15,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:03:15,976 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:03:15,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15" (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-31 09:03:16,065 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:03:16,065 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:03:16,065 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 09:03:16,066 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-31 09:03:16,066 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-31 09:03:16,066 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-31 09:03:16,066 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-31 09:03:16,066 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 09:03:16,066 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:03:16,066 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 09:03:16,067 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 09:03:16,067 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:03:16,067 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:03:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:03:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:03:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:03:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 09:03:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 09:03:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-31 09:03:16,068 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-31 09:03:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-31 09:03:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-31 09:03:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 09:03:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:03:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:03:16,069 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:03:16,574 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:03:16,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:03:16 BoogieIcfgContainer [2018-01-31 09:03:16,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:03:16,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:03:16,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:03:16,579 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:03:16,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:03:15" (1/3) ... [2018-01-31 09:03:16,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fdc9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:03:16, skipping insertion in model container [2018-01-31 09:03:16,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:03:15" (2/3) ... [2018-01-31 09:03:16,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36fdc9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:03:16, skipping insertion in model container [2018-01-31 09:03:16,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:03:16" (3/3) ... [2018-01-31 09:03:16,583 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-31 09:03:16,592 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:03:16,602 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-31 09:03:16,652 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:03:16,653 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:03:16,653 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:03:16,653 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:03:16,653 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:03:16,653 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:03:16,654 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:03:16,654 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:03:16,656 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:03:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states. [2018-01-31 09:03:16,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-31 09:03:16,686 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:16,687 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-31 09:03:16,687 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:16,692 INFO L82 PathProgramCache]: Analyzing trace with hash 111531579, now seen corresponding path program 1 times [2018-01-31 09:03:16,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:16,695 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:16,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:16,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:16,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:16,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:16,855 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-31 09:03:16,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:16,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:03:16,858 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:03:16,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:03:16,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:03:16,871 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 3 states. [2018-01-31 09:03:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:17,121 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-31 09:03:17,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:03:17,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-31 09:03:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:17,135 INFO L225 Difference]: With dead ends: 90 [2018-01-31 09:03:17,138 INFO L226 Difference]: Without dead ends: 85 [2018-01-31 09:03:17,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:03:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-31 09:03:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-01-31 09:03:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 09:03:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-31 09:03:17,184 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 5 [2018-01-31 09:03:17,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:17,184 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-31 09:03:17,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:03:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-31 09:03:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-31 09:03:17,185 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:17,185 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-31 09:03:17,185 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:17,185 INFO L82 PathProgramCache]: Analyzing trace with hash 111531580, now seen corresponding path program 1 times [2018-01-31 09:03:17,186 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:17,186 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:17,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:17,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:17,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:17,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:17,389 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-31 09:03:17,389 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-31 09:03:17,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:17,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:03:17,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:03:17,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:03:17,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:03:17,392 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 3 states. [2018-01-31 09:03:17,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:17,579 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2018-01-31 09:03:17,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:03:17,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-01-31 09:03:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:17,582 INFO L225 Difference]: With dead ends: 146 [2018-01-31 09:03:17,583 INFO L226 Difference]: Without dead ends: 144 [2018-01-31 09:03:17,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:03:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-31 09:03:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 135. [2018-01-31 09:03:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-31 09:03:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 151 transitions. [2018-01-31 09:03:17,614 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 151 transitions. Word has length 5 [2018-01-31 09:03:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:17,614 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 151 transitions. [2018-01-31 09:03:17,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:03:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2018-01-31 09:03:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:03:17,616 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:17,616 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] [2018-01-31 09:03:17,616 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash 109318138, now seen corresponding path program 1 times [2018-01-31 09:03:17,617 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:17,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:17,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:17,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:17,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:17,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:17,771 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-31 09:03:17,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:17,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:03:17,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:17,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:17,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:17,773 INFO L87 Difference]: Start difference. First operand 135 states and 151 transitions. Second operand 6 states. [2018-01-31 09:03:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:18,327 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2018-01-31 09:03:18,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:03:18,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-31 09:03:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:18,332 INFO L225 Difference]: With dead ends: 154 [2018-01-31 09:03:18,333 INFO L226 Difference]: Without dead ends: 137 [2018-01-31 09:03:18,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:18,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-31 09:03:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-01-31 09:03:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-31 09:03:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2018-01-31 09:03:18,352 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 32 [2018-01-31 09:03:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:18,353 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2018-01-31 09:03:18,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2018-01-31 09:03:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:03:18,355 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:18,355 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] [2018-01-31 09:03:18,355 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1150010177, now seen corresponding path program 1 times [2018-01-31 09:03:18,355 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:18,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:18,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:18,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:18,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:18,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:18,445 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-31 09:03:18,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:18,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:03:18,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:18,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:18,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:18,446 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand 5 states. [2018-01-31 09:03:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:18,646 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2018-01-31 09:03:18,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:18,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-31 09:03:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:18,649 INFO L225 Difference]: With dead ends: 138 [2018-01-31 09:03:18,649 INFO L226 Difference]: Without dead ends: 137 [2018-01-31 09:03:18,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-31 09:03:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-01-31 09:03:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-31 09:03:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 148 transitions. [2018-01-31 09:03:18,668 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 148 transitions. Word has length 34 [2018-01-31 09:03:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:18,669 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 148 transitions. [2018-01-31 09:03:18,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 148 transitions. [2018-01-31 09:03:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:03:18,670 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:18,670 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] [2018-01-31 09:03:18,671 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:18,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1150010176, now seen corresponding path program 1 times [2018-01-31 09:03:18,671 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:18,671 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:18,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:18,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:18,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:18,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:18,813 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-31 09:03:18,813 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:18,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:03:18,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:18,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:18,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:18,814 INFO L87 Difference]: Start difference. First operand 134 states and 148 transitions. Second operand 5 states. [2018-01-31 09:03:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:18,864 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-01-31 09:03:18,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:18,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-31 09:03:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:18,867 INFO L225 Difference]: With dead ends: 137 [2018-01-31 09:03:18,867 INFO L226 Difference]: Without dead ends: 136 [2018-01-31 09:03:18,868 INFO L554 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-31 09:03:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-31 09:03:18,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-01-31 09:03:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-31 09:03:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2018-01-31 09:03:18,883 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 34 [2018-01-31 09:03:18,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:18,883 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2018-01-31 09:03:18,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2018-01-31 09:03:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:03:18,885 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:18,885 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] [2018-01-31 09:03:18,885 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:18,885 INFO L82 PathProgramCache]: Analyzing trace with hash 593232167, now seen corresponding path program 1 times [2018-01-31 09:03:18,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:18,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:18,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:18,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:18,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:18,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:18,968 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-31 09:03:18,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:18,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 09:03:18,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 09:03:18,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 09:03:18,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:03:18,972 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand 3 states. [2018-01-31 09:03:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:19,158 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-31 09:03:19,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 09:03:19,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-01-31 09:03:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:19,160 INFO L225 Difference]: With dead ends: 140 [2018-01-31 09:03:19,160 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 09:03:19,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 09:03:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 09:03:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-01-31 09:03:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-31 09:03:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-01-31 09:03:19,175 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 34 [2018-01-31 09:03:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:19,175 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-01-31 09:03:19,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 09:03:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-01-31 09:03:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:03:19,177 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:19,177 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-01-31 09:03:19,177 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:19,178 INFO L82 PathProgramCache]: Analyzing trace with hash -631813317, now seen corresponding path program 1 times [2018-01-31 09:03:19,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:19,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:19,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:19,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:19,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:19,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:19,271 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-31 09:03:19,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:19,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:19,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:19,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:19,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:19,273 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 6 states. [2018-01-31 09:03:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:19,358 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2018-01-31 09:03:19,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:03:19,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-31 09:03:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:19,360 INFO L225 Difference]: With dead ends: 121 [2018-01-31 09:03:19,360 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 09:03:19,361 INFO L554 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-31 09:03:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 09:03:19,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-31 09:03:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-31 09:03:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2018-01-31 09:03:19,383 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 35 [2018-01-31 09:03:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:19,384 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2018-01-31 09:03:19,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2018-01-31 09:03:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-31 09:03:19,390 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:19,391 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-01-31 09:03:19,391 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash -631813316, now seen corresponding path program 1 times [2018-01-31 09:03:19,391 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:19,391 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:19,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:19,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:19,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:19,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:19,609 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-31 09:03:19,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:19,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:19,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:03:19,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:03:19,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:19,624 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 6 states. [2018-01-31 09:03:20,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:20,202 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-31 09:03:20,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:03:20,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-31 09:03:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:20,204 INFO L225 Difference]: With dead ends: 122 [2018-01-31 09:03:20,204 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 09:03:20,205 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 09:03:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-31 09:03:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-31 09:03:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2018-01-31 09:03:20,214 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 35 [2018-01-31 09:03:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:20,214 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2018-01-31 09:03:20,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:03:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2018-01-31 09:03:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 09:03:20,216 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:20,216 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] [2018-01-31 09:03:20,216 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:20,217 INFO L82 PathProgramCache]: Analyzing trace with hash 30583561, now seen corresponding path program 1 times [2018-01-31 09:03:20,217 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:20,217 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:20,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:20,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:20,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:20,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:20,343 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-31 09:03:20,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:20,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:20,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:20,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:20,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:20,345 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 5 states. [2018-01-31 09:03:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:20,416 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-01-31 09:03:20,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:20,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-31 09:03:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:20,417 INFO L225 Difference]: With dead ends: 126 [2018-01-31 09:03:20,418 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 09:03:20,418 INFO L554 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-31 09:03:20,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 09:03:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-31 09:03:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 09:03:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-31 09:03:20,425 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 42 [2018-01-31 09:03:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:20,425 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-31 09:03:20,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-31 09:03:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:03:20,427 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:20,427 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] [2018-01-31 09:03:20,427 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash 485326214, now seen corresponding path program 1 times [2018-01-31 09:03:20,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:20,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:20,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:20,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:20,429 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:20,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:20,869 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-31 09:03:20,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:20,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:03:20,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:03:20,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:03:20,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:03:20,870 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 7 states. [2018-01-31 09:03:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:21,311 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-01-31 09:03:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:03:21,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-01-31 09:03:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:21,313 INFO L225 Difference]: With dead ends: 78 [2018-01-31 09:03:21,313 INFO L226 Difference]: Without dead ends: 77 [2018-01-31 09:03:21,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:03:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-31 09:03:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-31 09:03:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 09:03:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-01-31 09:03:21,321 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 43 [2018-01-31 09:03:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:21,322 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-01-31 09:03:21,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:03:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-01-31 09:03:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 09:03:21,323 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:21,323 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] [2018-01-31 09:03:21,323 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash 485326213, now seen corresponding path program 1 times [2018-01-31 09:03:21,324 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:21,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:21,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:21,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:21,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:21,340 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:21,775 WARN L143 SmtUtils]: Spent 164ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 09:03:21,912 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-31 09:03:21,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:21,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:03:21,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:03:21,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:03:21,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:21,914 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 8 states. [2018-01-31 09:03:22,251 WARN L143 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 20 [2018-01-31 09:03:22,640 WARN L143 SmtUtils]: Spent 185ms on a formula simplification that was a NOOP. DAG size: 20 [2018-01-31 09:03:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:22,827 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-01-31 09:03:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 09:03:22,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-01-31 09:03:22,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:22,828 INFO L225 Difference]: With dead ends: 81 [2018-01-31 09:03:22,828 INFO L226 Difference]: Without dead ends: 63 [2018-01-31 09:03:22,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-01-31 09:03:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-31 09:03:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-31 09:03:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-31 09:03:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-01-31 09:03:22,837 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 43 [2018-01-31 09:03:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:22,837 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-01-31 09:03:22,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:03:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-01-31 09:03:22,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:03:22,842 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:22,843 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-01-31 09:03:22,843 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:22,843 INFO L82 PathProgramCache]: Analyzing trace with hash 384174065, now seen corresponding path program 1 times [2018-01-31 09:03:22,843 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:22,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:22,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:22,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:22,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:22,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:23,096 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-31 09:03:23,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:23,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 09:03:23,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 09:03:23,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 09:03:23,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:03:23,097 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 10 states. [2018-01-31 09:03:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:23,488 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-01-31 09:03:23,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:03:23,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-01-31 09:03:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:23,529 INFO L225 Difference]: With dead ends: 63 [2018-01-31 09:03:23,529 INFO L226 Difference]: Without dead ends: 62 [2018-01-31 09:03:23,529 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-01-31 09:03:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-31 09:03:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-31 09:03:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-31 09:03:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-01-31 09:03:23,538 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 45 [2018-01-31 09:03:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:23,538 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-01-31 09:03:23,538 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 09:03:23,538 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-01-31 09:03:23,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 09:03:23,539 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:23,539 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-01-31 09:03:23,539 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:23,540 INFO L82 PathProgramCache]: Analyzing trace with hash 384174064, now seen corresponding path program 1 times [2018-01-31 09:03:23,540 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:23,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:23,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:23,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:23,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:23,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:24,031 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-31 09:03:24,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:24,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:03:24,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:03:24,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:03:24,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:03:24,032 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 8 states. [2018-01-31 09:03:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:24,278 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-01-31 09:03:24,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 09:03:24,278 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-01-31 09:03:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:24,279 INFO L225 Difference]: With dead ends: 62 [2018-01-31 09:03:24,279 INFO L226 Difference]: Without dead ends: 61 [2018-01-31 09:03:24,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-31 09:03:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-31 09:03:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-31 09:03:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-31 09:03:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-01-31 09:03:24,285 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 45 [2018-01-31 09:03:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:24,285 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-01-31 09:03:24,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:03:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-01-31 09:03:24,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-31 09:03:24,286 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:24,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:24,287 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:24,287 INFO L82 PathProgramCache]: Analyzing trace with hash -366146626, now seen corresponding path program 1 times [2018-01-31 09:03:24,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:24,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:24,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:24,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:24,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:03:24,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:03:24,482 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-31 09:03:24,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:03:24,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:03:24,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:03:24,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:03:24,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:03:24,483 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 5 states. [2018-01-31 09:03:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:03:24,511 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2018-01-31 09:03:24,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:03:24,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2018-01-31 09:03:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:03:24,512 INFO L225 Difference]: With dead ends: 66 [2018-01-31 09:03:24,512 INFO L226 Difference]: Without dead ends: 61 [2018-01-31 09:03:24,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:03:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-31 09:03:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-31 09:03:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-31 09:03:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 60 transitions. [2018-01-31 09:03:24,520 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 60 transitions. Word has length 56 [2018-01-31 09:03:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:03:24,520 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 60 transitions. [2018-01-31 09:03:24,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:03:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 60 transitions. [2018-01-31 09:03:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-31 09:03:24,521 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:03:24,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:03:24,522 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, probe1_6Err1RequiresViolation, probe1_6Err2RequiresViolation, probe1_6Err3RequiresViolation, probe1_6Err0RequiresViolation]=== [2018-01-31 09:03:24,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1923550661, now seen corresponding path program 1 times [2018-01-31 09:03:24,522 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:03:24,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:03:24,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:24,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:03:24,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:03:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:03:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:03:24,585 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 09:03:24,609 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-31 09:03:24,615 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:03:24,615 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:03:24,616 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:03:24,617 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-31 09:03:24,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:03:24 BoogieIcfgContainer [2018-01-31 09:03:24,635 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:03:24,636 INFO L168 Benchmark]: Toolchain (without parser) took 9044.69 ms. Allocated memory was 305.7 MB in the beginning and 515.4 MB in the end (delta: 209.7 MB). Free memory was 264.7 MB in the beginning and 406.6 MB in the end (delta: -141.9 MB). Peak memory consumption was 67.8 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:24,637 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:03:24,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.12 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 251.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:24,638 INFO L168 Benchmark]: Boogie Preprocessor took 42.79 ms. Allocated memory is still 305.7 MB. Free memory was 251.7 MB in the beginning and 249.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:24,638 INFO L168 Benchmark]: RCFGBuilder took 599.56 ms. Allocated memory is still 305.7 MB. Free memory was 249.7 MB in the beginning and 228.9 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:24,638 INFO L168 Benchmark]: TraceAbstraction took 8058.66 ms. Allocated memory was 305.7 MB in the beginning and 515.4 MB in the end (delta: 209.7 MB). Free memory was 228.9 MB in the beginning and 406.6 MB in the end (delta: -177.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:03:24,640 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 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 330.12 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 251.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.79 ms. Allocated memory is still 305.7 MB. Free memory was 251.7 MB in the beginning and 249.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 599.56 ms. Allocated memory is still 305.7 MB. Free memory was 249.7 MB in the beginning and 228.9 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8058.66 ms. Allocated memory was 305.7 MB in the beginning and 515.4 MB in the end (delta: 209.7 MB). Free memory was 228.9 MB in the beginning and 406.6 MB in the end (delta: -177.7 MB). Peak memory consumption was 32.1 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1476]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1476. Possible FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1465] FCALL struct A a6; VAL [a6={7:0}] [L1477] CALL entry_point() VAL [a6={7:0}] [L1469] CALL, EXPR probe1_6(&a6) VAL [a={7:0}, a6={7:0}] [L1443] int ret = - -3; VAL [a={7:0}, a={7:0}, a6={7:0}, ret=3] [L1444] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={7:0}] [L1073] COND TRUE __VERIFIER_nondet_int() VAL [\old(size)=4, __VERIFIER_nondet_int()=1, a6={7:0}, size=4] [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=4, a6={7:0}, malloc(size)={9:0}, size=4] [L1074] RET return malloc(size); VAL [\old(size)=4, \result={9:0}, a6={7:0}, malloc(size)={9:0}, size=4] [L1444] EXPR ldv_malloc(sizeof(int)) VAL [a={7:0}, a={7:0}, a6={7:0}, ldv_malloc(sizeof(int))={9:0}, ret=3] [L1444] int *p = (int *)ldv_malloc(sizeof(int)); VAL [a={7:0}, a={7:0}, a6={7:0}, ldv_malloc(sizeof(int))={9:0}, p={9:0}, ret=3] [L1445] COND FALSE !(p==0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={9:0}, ret=3] [L1447] CALL, EXPR f6() VAL [a6={7:0}] [L1435] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0, a6={7:0}] [L1447] EXPR f6() VAL [a={7:0}, a={7:0}, a6={7:0}, f6()=0, p={9:0}, ret=3] [L1447] ret = f6() VAL [a={7:0}, a={7:0}, a6={7:0}, f6()=0, p={9:0}, ret=0] [L1448] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={9:0}, ret=0] [L1450] CALL, EXPR g6() VAL [a6={7:0}] [L1439] RET return __VERIFIER_nondet_int(); VAL [\result=0, __VERIFIER_nondet_int()=0, a6={7:0}] [L1450] EXPR g6() VAL [a={7:0}, a={7:0}, a6={7:0}, g6()=0, p={9:0}, ret=0] [L1450] ret = g6() VAL [a={7:0}, a={7:0}, a6={7:0}, g6()=0, p={9:0}, ret=0] [L1451] COND FALSE !(ret<0) VAL [a={7:0}, a={7:0}, a6={7:0}, p={9:0}, ret=0] [L1453] FCALL a->p = p VAL [a={7:0}, a={7:0}, a6={7:0}, p={9:0}, ret=0] [L1454] RET return 0; VAL [\result=0, a={7:0}, a={7:0}, a6={7:0}, p={9:0}, ret=0] [L1469] EXPR probe1_6(&a6) VAL [a6={7:0}, probe1_6(&a6)=0] [L1469] int ret = probe1_6(&a6); VAL [a6={7:0}, probe1_6(&a6)=0, ret=0] [L1470] COND TRUE ret==0 VAL [a6={7:0}, ret=0] [L1471] FCALL disconnect_2_6(&a6) VAL [a6={7:0}, ret=0] [L1473] RET, FCALL a6.p = 0 VAL [a6={7:0}, ret=0] [L1477] entry_point() VAL [a6={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 77 locations, 9 error locations. UNSAFE Result, 7.9s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 946 SDtfs, 713 SDslu, 2165 SDs, 0 SdLazy, 786 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=2, 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.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 548 NumberOfCodeBlocks, 548 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 474 ConstructedInterpolants, 0 QuantifiedInterpolants, 88060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-03-24-648.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-03-24-648.csv Received shutdown request...