java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-26d9e06-m
[2018-02-02 09:24:25,730 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-02 09:24:25,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-02 09:24:25,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-02 09:24:25,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-02 09:24:25,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-02 09:24:25,747 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-02 09:24:25,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-02 09:24:25,750 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-02 09:24:25,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-02 09:24:25,751 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-02 09:24:25,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-02 09:24:25,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-02 09:24:25,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-02 09:24:25,754 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-02 09:24:25,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-02 09:24:25,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-02 09:24:25,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-02 09:24:25,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-02 09:24:25,760 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-02 09:24:25,762 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-02 09:24:25,762 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-02 09:24:25,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-02 09:24:25,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-02 09:24:25,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-02 09:24:25,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-02 09:24:25,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-02 09:24:25,765 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-02 09:24:25,765 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-02 09:24:25,766 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-02 09:24:25,766 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-02 09:24:25,766 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf
[2018-02-02 09:24:25,776 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-02 09:24:25,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-02 09:24:25,777 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-02 09:24:25,777 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-02 09:24:25,777 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-02 09:24:25,778 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-02 09:24:25,778 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-02 09:24:25,778 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-02 09:24:25,778 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-02 09:24:25,778 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-02 09:24:25,778 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-02 09:24:25,779 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-02 09:24:25,779 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-02 09:24:25,779 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-02 09:24:25,779 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-02 09:24:25,779 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-02 09:24:25,779 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-02 09:24:25,779 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-02 09:24:25,780 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-02 09:24:25,780 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-02 09:24:25,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 09:24:25,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-02 09:24:25,780 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-02 09:24:25,780 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-02 09:24:25,780 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-02-02 09:24:25,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-02 09:24:25,818 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-02 09:24:25,821 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-02 09:24:25,822 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-02 09:24:25,823 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-02 09:24:25,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i
[2018-02-02 09:24:25,973 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-02 09:24:25,974 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-02 09:24:25,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-02 09:24:25,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-02 09:24:25,980 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-02 09:24:25,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:24:25" (1/1) ...
[2018-02-02 09:24:25,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fe7432b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:25, skipping insertion in model container
[2018-02-02 09:24:25,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:24:25" (1/1) ...
[2018-02-02 09:24:25,994 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:24:26,020 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-02 09:24:26,099 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:24:26,110 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-02 09:24:26,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:26 WrapperNode
[2018-02-02 09:24:26,114 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-02 09:24:26,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-02 09:24:26,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-02 09:24:26,115 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-02 09:24:26,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:26" (1/1) ...
[2018-02-02 09:24:26,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:26" (1/1) ...
[2018-02-02 09:24:26,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:26" (1/1) ...
[2018-02-02 09:24:26,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:26" (1/1) ...
[2018-02-02 09:24:26,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:26" (1/1) ...
[2018-02-02 09:24:26,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:26" (1/1) ...
[2018-02-02 09:24:26,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:26" (1/1) ...
[2018-02-02 09:24:26,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-02 09:24:26,140 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-02 09:24:26,141 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-02 09:24:26,141 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-02 09:24:26,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:26" (1/1) ...
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-02 09:24:26,172 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-02 09:24:26,172 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-02 09:24:26,172 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc
[2018-02-02 09:24:26,172 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point
[2018-02-02 09:24:26,172 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-02 09:24:26,173 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-02 09:24:26,303 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-02 09:24:26,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:24:26 BoogieIcfgContainer
[2018-02-02 09:24:26,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-02 09:24:26,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-02 09:24:26,304 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-02 09:24:26,306 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-02 09:24:26,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:24:25" (1/3) ...
[2018-02-02 09:24:26,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abda2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:24:26, skipping insertion in model container
[2018-02-02 09:24:26,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:24:26" (2/3) ...
[2018-02-02 09:24:26,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abda2ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:24:26, skipping insertion in model container
[2018-02-02 09:24:26,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:24:26" (3/3) ...
[2018-02-02 09:24:26,308 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i
[2018-02-02 09:24:26,313 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-02 09:24:26,318 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations.
[2018-02-02 09:24:26,347 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-02 09:24:26,347 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-02 09:24:26,347 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-02 09:24:26,347 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-02 09:24:26,347 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-02 09:24:26,347 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-02 09:24:26,347 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-02 09:24:26,347 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-02 09:24:26,348 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-02 09:24:26,357 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states.
[2018-02-02 09:24:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2018-02-02 09:24:26,364 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:24:26,365 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:24:26,365 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:24:26,369 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times
[2018-02-02 09:24:26,371 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:24:26,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:24:26,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:26,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:24:26,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:24:26,449 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:24:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:24:26,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:24:26,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-02 09:24:26,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-02 09:24:26,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-02 09:24:26,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:24:26,522 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states.
[2018-02-02 09:24:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:24:26,657 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions.
[2018-02-02 09:24:26,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-02 09:24:26,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17
[2018-02-02 09:24:26,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:24:26,667 INFO L225 Difference]: With dead ends: 74
[2018-02-02 09:24:26,667 INFO L226 Difference]: Without dead ends: 68
[2018-02-02 09:24:26,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-02 09:24:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2018-02-02 09:24:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54.
[2018-02-02 09:24:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-02-02 09:24:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions.
[2018-02-02 09:24:26,703 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17
[2018-02-02 09:24:26,703 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:24:26,703 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions.
[2018-02-02 09:24:26,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-02 09:24:26,704 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions.
[2018-02-02 09:24:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2018-02-02 09:24:26,705 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:24:26,705 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:24:26,705 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:24:26,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times
[2018-02-02 09:24:26,705 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:24:26,705 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:24:26,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:26,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:24:26,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:24:26,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:24:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:24:26,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:24:26,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 09:24:26,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:24:26,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:24:26,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:24:26,776 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states.
[2018-02-02 09:24:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:24:26,846 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions.
[2018-02-02 09:24:26,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:24:26,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2018-02-02 09:24:26,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:24:26,848 INFO L225 Difference]: With dead ends: 78
[2018-02-02 09:24:26,848 INFO L226 Difference]: Without dead ends: 78
[2018-02-02 09:24:26,849 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:24:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2018-02-02 09:24:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54.
[2018-02-02 09:24:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states.
[2018-02-02 09:24:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions.
[2018-02-02 09:24:26,855 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19
[2018-02-02 09:24:26,855 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:24:26,855 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions.
[2018-02-02 09:24:26,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:24:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions.
[2018-02-02 09:24:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2018-02-02 09:24:26,856 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:24:26,856 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]
[2018-02-02 09:24:26,857 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:24:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times
[2018-02-02 09:24:26,857 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:24:26,857 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:24:26,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:26,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:24:26,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:24:26,876 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:24:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:24:26,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:24:26,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:24:26,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:24:26,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:24:26,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:24:26,911 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states.
[2018-02-02 09:24:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:24:26,935 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions.
[2018-02-02 09:24:26,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-02 09:24:26,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21
[2018-02-02 09:24:26,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:24:26,937 INFO L225 Difference]: With dead ends: 86
[2018-02-02 09:24:26,938 INFO L226 Difference]: Without dead ends: 86
[2018-02-02 09:24:26,938 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:24:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-02-02 09:24:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56.
[2018-02-02 09:24:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2018-02-02 09:24:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions.
[2018-02-02 09:24:26,941 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21
[2018-02-02 09:24:26,942 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:24:26,942 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions.
[2018-02-02 09:24:26,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:24:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions.
[2018-02-02 09:24:26,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-02-02 09:24:26,943 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:24:26,943 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:24:26,943 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:24:26,943 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times
[2018-02-02 09:24:26,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:24:26,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:24:26,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:26,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:24:26,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:24:26,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:24:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 09:24:26,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:24:26,994 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:24:27,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:24:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:24:27,030 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:24:27,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:24:27,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:24:27,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5
[2018-02-02 09:24:27,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:24:27,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:24:27,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:24:27,070 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states.
[2018-02-02 09:24:27,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:24:27,088 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions.
[2018-02-02 09:24:27,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:24:27,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24
[2018-02-02 09:24:27,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:24:27,089 INFO L225 Difference]: With dead ends: 49
[2018-02-02 09:24:27,089 INFO L226 Difference]: Without dead ends: 47
[2018-02-02 09:24:27,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:24:27,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2018-02-02 09:24:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2018-02-02 09:24:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states.
[2018-02-02 09:24:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions.
[2018-02-02 09:24:27,093 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24
[2018-02-02 09:24:27,093 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:24:27,094 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions.
[2018-02-02 09:24:27,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:24:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions.
[2018-02-02 09:24:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-02-02 09:24:27,094 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:24:27,095 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:24:27,095 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:24:27,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times
[2018-02-02 09:24:27,095 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:24:27,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:24:27,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:27,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:24:27,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:24:27,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:24:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 09:24:27,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:24:27,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:24:27,141 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-02 09:24:27,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-02 09:24:27,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:24:27,141 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states.
[2018-02-02 09:24:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:24:27,151 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions.
[2018-02-02 09:24:27,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:24:27,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26
[2018-02-02 09:24:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:24:27,151 INFO L225 Difference]: With dead ends: 51
[2018-02-02 09:24:27,152 INFO L226 Difference]: Without dead ends: 51
[2018-02-02 09:24:27,152 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:24:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2018-02-02 09:24:27,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49.
[2018-02-02 09:24:27,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2018-02-02 09:24:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions.
[2018-02-02 09:24:27,155 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26
[2018-02-02 09:24:27,156 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:24:27,156 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions.
[2018-02-02 09:24:27,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-02 09:24:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions.
[2018-02-02 09:24:27,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 09:24:27,157 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:24:27,157 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:24:27,157 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:24:27,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times
[2018-02-02 09:24:27,157 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:24:27,157 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:24:27,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:27,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:24:27,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:24:27,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:24:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:24:27,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:24:27,248 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:24:27,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:24:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:24:27,271 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:24:27,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-02-02 09:24:27,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:27,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:27,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-02-02 09:24:27,326 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:24:27,327 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:24:27,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21
[2018-02-02 09:24:27,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:27,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:24:27,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15
[2018-02-02 09:24:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:24:27,371 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:24:27,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10
[2018-02-02 09:24:27,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states
[2018-02-02 09:24:27,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2018-02-02 09:24:27,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2018-02-02 09:24:27,372 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 11 states.
[2018-02-02 09:24:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:24:27,624 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions.
[2018-02-02 09:24:27,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 09:24:27,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28
[2018-02-02 09:24:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:24:27,626 INFO L225 Difference]: With dead ends: 72
[2018-02-02 09:24:27,626 INFO L226 Difference]: Without dead ends: 72
[2018-02-02 09:24:27,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210
[2018-02-02 09:24:27,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2018-02-02 09:24:27,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52.
[2018-02-02 09:24:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states.
[2018-02-02 09:24:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions.
[2018-02-02 09:24:27,630 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 28
[2018-02-02 09:24:27,630 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:24:27,630 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions.
[2018-02-02 09:24:27,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states.
[2018-02-02 09:24:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions.
[2018-02-02 09:24:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-02 09:24:27,631 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:24:27,632 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:24:27,632 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:24:27,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times
[2018-02-02 09:24:27,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:24:27,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:24:27,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:27,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:24:27,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:24:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:24:27,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:24:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:24:27,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:24:27,912 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:24:27,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:24:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:24:27,945 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:24:27,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2018-02-02 09:24:27,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:28,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2018-02-02 09:24:28,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:28,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24
[2018-02-02 09:24:28,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:28,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21
[2018-02-02 09:24:28,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:28,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:24:28,036 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46
[2018-02-02 09:24:28,212 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:24:28,221 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:24:28,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46
[2018-02-02 09:24:28,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:28,254 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:24:28,254 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:24:28,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41
[2018-02-02 09:24:28,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:28,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38
[2018-02-02 09:24:28,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:28,323 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:24:28,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50
[2018-02-02 09:24:28,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:24:28,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:24:28,354 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75
[2018-02-02 09:24:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:24:28,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:24:28,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18
[2018-02-02 09:24:28,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-02-02 09:24:28,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-02-02 09:24:28,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=295, Unknown=1, NotChecked=0, Total=342
[2018-02-02 09:24:28,443 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 19 states.
[2018-02-02 09:25:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:10,989 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions.
[2018-02-02 09:25:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-02 09:25:10,989 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28
[2018-02-02 09:25:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:10,990 INFO L225 Difference]: With dead ends: 103
[2018-02-02 09:25:10,990 INFO L226 Difference]: Without dead ends: 103
[2018-02-02 09:25:10,990 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=122, Invalid=686, Unknown=4, NotChecked=0, Total=812
[2018-02-02 09:25:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2018-02-02 09:25:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 70.
[2018-02-02 09:25:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states.
[2018-02-02 09:25:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions.
[2018-02-02 09:25:10,994 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 28
[2018-02-02 09:25:10,994 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:10,995 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions.
[2018-02-02 09:25:10,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-02-02 09:25:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions.
[2018-02-02 09:25:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-02 09:25:10,996 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:10,996 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:10,996 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1097237542, now seen corresponding path program 1 times
[2018-02-02 09:25:10,996 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:10,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:10,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:10,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:10,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:11,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2018-02-02 09:25:11,027 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:25:11,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-02 09:25:11,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-02 09:25:11,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-02 09:25:11,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-02 09:25:11,028 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 4 states.
[2018-02-02 09:25:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:11,050 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions.
[2018-02-02 09:25:11,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:25:11,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29
[2018-02-02 09:25:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:11,051 INFO L225 Difference]: With dead ends: 67
[2018-02-02 09:25:11,051 INFO L226 Difference]: Without dead ends: 67
[2018-02-02 09:25:11,051 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-02 09:25:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2018-02-02 09:25:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62.
[2018-02-02 09:25:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states.
[2018-02-02 09:25:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions.
[2018-02-02 09:25:11,055 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 29
[2018-02-02 09:25:11,055 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:11,055 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions.
[2018-02-02 09:25:11,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-02 09:25:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions.
[2018-02-02 09:25:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-02 09:25:11,055 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:11,055 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:11,056 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:11,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1190998490, now seen corresponding path program 1 times
[2018-02-02 09:25:11,056 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:11,056 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:11,056 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:11,056 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:11,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:11,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 09:25:11,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:25:11,153 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:25:11,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:11,178 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:25:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 09:25:11,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:25:11,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12
[2018-02-02 09:25:11,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-02 09:25:11,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-02 09:25:11,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=122, Unknown=9, NotChecked=0, Total=156
[2018-02-02 09:25:11,288 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 13 states.
[2018-02-02 09:25:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:11,505 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions.
[2018-02-02 09:25:11,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-02 09:25:11,505 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32
[2018-02-02 09:25:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:11,506 INFO L225 Difference]: With dead ends: 69
[2018-02-02 09:25:11,506 INFO L226 Difference]: Without dead ends: 60
[2018-02-02 09:25:11,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=247, Unknown=9, NotChecked=0, Total=306
[2018-02-02 09:25:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2018-02-02 09:25:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60.
[2018-02-02 09:25:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2018-02-02 09:25:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions.
[2018-02-02 09:25:11,510 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 32
[2018-02-02 09:25:11,510 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:11,510 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions.
[2018-02-02 09:25:11,510 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-02 09:25:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions.
[2018-02-02 09:25:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-02-02 09:25:11,511 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:11,511 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:11,511 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:11,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1833910404, now seen corresponding path program 1 times
[2018-02-02 09:25:11,512 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:11,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:11,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:11,513 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:11,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:11,519 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 09:25:11,554 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:25:11,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-02 09:25:11,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:25:11,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:25:11,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:25:11,555 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand 6 states.
[2018-02-02 09:25:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:11,577 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions.
[2018-02-02 09:25:11,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 09:25:11,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34
[2018-02-02 09:25:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:11,578 INFO L225 Difference]: With dead ends: 58
[2018-02-02 09:25:11,578 INFO L226 Difference]: Without dead ends: 58
[2018-02-02 09:25:11,579 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2018-02-02 09:25:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2018-02-02 09:25:11,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56.
[2018-02-02 09:25:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states.
[2018-02-02 09:25:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions.
[2018-02-02 09:25:11,581 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 34
[2018-02-02 09:25:11,582 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:11,582 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions.
[2018-02-02 09:25:11,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:25:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions.
[2018-02-02 09:25:11,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-02-02 09:25:11,583 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:11,583 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:11,583 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:11,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1409435322, now seen corresponding path program 1 times
[2018-02-02 09:25:11,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:11,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:11,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:11,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:11,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:11,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 09:25:11,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:25:11,620 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:25:11,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:11,646 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:25:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 09:25:11,693 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:25:11,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7
[2018-02-02 09:25:11,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 09:25:11,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 09:25:11,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:25:11,694 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 7 states.
[2018-02-02 09:25:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:11,725 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions.
[2018-02-02 09:25:11,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:25:11,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34
[2018-02-02 09:25:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:11,726 INFO L225 Difference]: With dead ends: 87
[2018-02-02 09:25:11,726 INFO L226 Difference]: Without dead ends: 87
[2018-02-02 09:25:11,726 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:25:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2018-02-02 09:25:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59.
[2018-02-02 09:25:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2018-02-02 09:25:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions.
[2018-02-02 09:25:11,729 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 34
[2018-02-02 09:25:11,729 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:11,729 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions.
[2018-02-02 09:25:11,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 09:25:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions.
[2018-02-02 09:25:11,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-02-02 09:25:11,730 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:11,730 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:11,730 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:11,730 INFO L82 PathProgramCache]: Analyzing trace with hash 804244387, now seen corresponding path program 1 times
[2018-02-02 09:25:11,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:11,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:11,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:11,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:11,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:11,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 09:25:12,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:25:12,031 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:25:12,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:12,061 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:25:12,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2018-02-02 09:25:12,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:12,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25
[2018-02-02 09:25:12,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:12,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24
[2018-02-02 09:25:12,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:12,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21
[2018-02-02 09:25:12,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:12,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:25:12,127 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46
[2018-02-02 09:25:12,351 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:12,353 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:12,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 25
[2018-02-02 09:25:12,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:12,383 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:12,383 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:12,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:25:12,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:12,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:25:12,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27
[2018-02-02 09:25:12,558 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:12,559 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:12,565 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:12,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 34
[2018-02-02 09:25:12,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:12,589 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:12,590 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:12,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:25:12,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:12,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:25:12,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:32
[2018-02-02 09:25:12,672 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 09:25:12,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:25:12,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24
[2018-02-02 09:25:12,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-02-02 09:25:12,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-02-02 09:25:12,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=528, Unknown=1, NotChecked=0, Total=600
[2018-02-02 09:25:12,701 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand 25 states.
[2018-02-02 09:25:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:13,229 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions.
[2018-02-02 09:25:13,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 09:25:13,229 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 41
[2018-02-02 09:25:13,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:13,230 INFO L225 Difference]: With dead ends: 86
[2018-02-02 09:25:13,230 INFO L226 Difference]: Without dead ends: 86
[2018-02-02 09:25:13,231 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=982, Unknown=3, NotChecked=0, Total=1122
[2018-02-02 09:25:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-02-02 09:25:13,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77.
[2018-02-02 09:25:13,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states.
[2018-02-02 09:25:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions.
[2018-02-02 09:25:13,233 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 41
[2018-02-02 09:25:13,233 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:13,233 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions.
[2018-02-02 09:25:13,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-02-02 09:25:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions.
[2018-02-02 09:25:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-02 09:25:13,234 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:13,234 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:13,234 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:13,234 INFO L82 PathProgramCache]: Analyzing trace with hash 835021389, now seen corresponding path program 1 times
[2018-02-02 09:25:13,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:13,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:13,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:13,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:13,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:13,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2018-02-02 09:25:13,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-02 09:25:13,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-02 09:25:13,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:25:13,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:25:13,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:25:13,292 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 6 states.
[2018-02-02 09:25:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:13,352 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions.
[2018-02-02 09:25:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:25:13,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42
[2018-02-02 09:25:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:13,353 INFO L225 Difference]: With dead ends: 80
[2018-02-02 09:25:13,353 INFO L226 Difference]: Without dead ends: 80
[2018-02-02 09:25:13,354 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:25:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states.
[2018-02-02 09:25:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77.
[2018-02-02 09:25:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states.
[2018-02-02 09:25:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions.
[2018-02-02 09:25:13,356 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 42
[2018-02-02 09:25:13,356 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:13,356 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions.
[2018-02-02 09:25:13,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:25:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions.
[2018-02-02 09:25:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-02-02 09:25:13,357 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:13,357 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:13,357 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash 115859282, now seen corresponding path program 1 times
[2018-02-02 09:25:13,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:13,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:13,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:13,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:13,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:13,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2018-02-02 09:25:13,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:25:13,499 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:25:13,503 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:13,517 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:25:13,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12
[2018-02-02 09:25:13,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2018-02-02 09:25:13,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:13,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:13,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:13,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15
[2018-02-02 09:25:13,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19
[2018-02-02 09:25:13,649 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:25:13,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15
[2018-02-02 09:25:13,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:13,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:13,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:13,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3
[2018-02-02 09:25:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 09:25:13,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:25:13,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19
[2018-02-02 09:25:13,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states
[2018-02-02 09:25:13,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2018-02-02 09:25:13,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380
[2018-02-02 09:25:13,675 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 20 states.
[2018-02-02 09:25:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:13,917 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions.
[2018-02-02 09:25:13,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2018-02-02 09:25:13,917 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43
[2018-02-02 09:25:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:13,918 INFO L225 Difference]: With dead ends: 93
[2018-02-02 09:25:13,918 INFO L226 Difference]: Without dead ends: 93
[2018-02-02 09:25:13,918 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756
[2018-02-02 09:25:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2018-02-02 09:25:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85.
[2018-02-02 09:25:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states.
[2018-02-02 09:25:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions.
[2018-02-02 09:25:13,921 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 43
[2018-02-02 09:25:13,921 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:13,921 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions.
[2018-02-02 09:25:13,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2018-02-02 09:25:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions.
[2018-02-02 09:25:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2018-02-02 09:25:13,922 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:13,922 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:13,922 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:13,922 INFO L82 PathProgramCache]: Analyzing trace with hash 115859283, now seen corresponding path program 1 times
[2018-02-02 09:25:13,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:13,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:13,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:13,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:13,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:13,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 09:25:14,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:25:14,163 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:25:14,182 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:14,209 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:25:14,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-02-02 09:25:14,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:14,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:14,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-02-02 09:25:14,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12
[2018-02-02 09:25:14,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2018-02-02 09:25:14,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:14,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:14,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:14,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17
[2018-02-02 09:25:14,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1
[2018-02-02 09:25:14,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:14,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:14,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:20, output treesize:3
[2018-02-02 09:25:14,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21
[2018-02-02 09:25:14,357 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:25:14,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17
[2018-02-02 09:25:14,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:14,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:14,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:14,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:5
[2018-02-02 09:25:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 09:25:14,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:25:14,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21
[2018-02-02 09:25:14,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states
[2018-02-02 09:25:14,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2018-02-02 09:25:14,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462
[2018-02-02 09:25:14,387 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 22 states.
[2018-02-02 09:25:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:14,644 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions.
[2018-02-02 09:25:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-02 09:25:14,644 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43
[2018-02-02 09:25:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:14,645 INFO L225 Difference]: With dead ends: 86
[2018-02-02 09:25:14,645 INFO L226 Difference]: Without dead ends: 86
[2018-02-02 09:25:14,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812
[2018-02-02 09:25:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2018-02-02 09:25:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2018-02-02 09:25:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states.
[2018-02-02 09:25:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions.
[2018-02-02 09:25:14,647 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 43
[2018-02-02 09:25:14,647 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:14,647 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions.
[2018-02-02 09:25:14,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2018-02-02 09:25:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions.
[2018-02-02 09:25:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-02-02 09:25:14,647 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:14,648 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:14,648 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:14,648 INFO L82 PathProgramCache]: Analyzing trace with hash -329856377, now seen corresponding path program 1 times
[2018-02-02 09:25:14,648 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:14,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:14,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:14,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:14,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:14,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-02-02 09:25:14,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:25:14,681 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:25:14,688 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:14,702 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:25:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-02-02 09:25:14,723 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-02 09:25:14,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6
[2018-02-02 09:25:14,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-02 09:25:14,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-02 09:25:14,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-02-02 09:25:14,724 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 6 states.
[2018-02-02 09:25:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:14,774 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions.
[2018-02-02 09:25:14,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-02 09:25:14,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45
[2018-02-02 09:25:14,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:14,775 INFO L225 Difference]: With dead ends: 84
[2018-02-02 09:25:14,775 INFO L226 Difference]: Without dead ends: 84
[2018-02-02 09:25:14,775 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:25:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2018-02-02 09:25:14,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2018-02-02 09:25:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2018-02-02 09:25:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions.
[2018-02-02 09:25:14,778 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 45
[2018-02-02 09:25:14,778 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:14,778 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions.
[2018-02-02 09:25:14,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-02 09:25:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions.
[2018-02-02 09:25:14,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2018-02-02 09:25:14,779 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:14,779 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:14,779 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1632885427, now seen corresponding path program 2 times
[2018-02-02 09:25:14,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:14,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:14,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:14,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:14,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:14,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2018-02-02 09:25:14,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:25:14,826 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:25:14,835 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-02 09:25:14,849 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:25:14,857 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-02-02 09:25:14,859 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-02 09:25:14,861 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:25:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2018-02-02 09:25:14,916 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:25:14,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9
[2018-02-02 09:25:14,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-02 09:25:14,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-02 09:25:14,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:25:14,917 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 9 states.
[2018-02-02 09:25:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:14,960 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions.
[2018-02-02 09:25:14,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-02 09:25:14,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47
[2018-02-02 09:25:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:14,961 INFO L225 Difference]: With dead ends: 120
[2018-02-02 09:25:14,961 INFO L226 Difference]: Without dead ends: 120
[2018-02-02 09:25:14,961 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:25:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2018-02-02 09:25:14,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87.
[2018-02-02 09:25:14,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states.
[2018-02-02 09:25:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions.
[2018-02-02 09:25:14,964 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 47
[2018-02-02 09:25:14,965 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:14,965 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions.
[2018-02-02 09:25:14,965 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-02 09:25:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions.
[2018-02-02 09:25:14,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 09:25:14,965 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:14,965 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:14,966 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:14,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576177, now seen corresponding path program 1 times
[2018-02-02 09:25:14,966 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:14,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:14,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:14,967 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-02 09:25:14,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:14,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-02 09:25:15,190 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:25:15,190 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:25:15,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:15,210 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:25:15,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-02-02 09:25:15,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-02-02 09:25:15,283 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:15,284 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:15,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4
[2018-02-02 09:25:15,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12
[2018-02-02 09:25:15,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12
[2018-02-02 09:25:15,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2018-02-02 09:25:15,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:33
[2018-02-02 09:25:15,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1
[2018-02-02 09:25:15,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:25:15,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:31
[2018-02-02 09:25:15,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30
[2018-02-02 09:25:15,536 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:25:15,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20
[2018-02-02 09:25:15,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14
[2018-02-02 09:25:15,563 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-02 09:25:15,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21
[2018-02-02 09:25:15,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:15,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-02-02 09:25:15,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15
[2018-02-02 09:25:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-02 09:25:15,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:25:15,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32
[2018-02-02 09:25:15,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-02-02 09:25:15,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-02-02 09:25:15,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056
[2018-02-02 09:25:15,609 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 33 states.
[2018-02-02 09:25:16,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:16,670 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions.
[2018-02-02 09:25:16,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-02-02 09:25:16,670 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 48
[2018-02-02 09:25:16,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:16,671 INFO L225 Difference]: With dead ends: 100
[2018-02-02 09:25:16,671 INFO L226 Difference]: Without dead ends: 100
[2018-02-02 09:25:16,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=2674, Unknown=0, NotChecked=0, Total=3080
[2018-02-02 09:25:16,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2018-02-02 09:25:16,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93.
[2018-02-02 09:25:16,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2018-02-02 09:25:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions.
[2018-02-02 09:25:16,673 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 48
[2018-02-02 09:25:16,673 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:16,673 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions.
[2018-02-02 09:25:16,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-02-02 09:25:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions.
[2018-02-02 09:25:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-02 09:25:16,674 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:16,674 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:16,674 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:16,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1207576227, now seen corresponding path program 1 times
[2018-02-02 09:25:16,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:16,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:16,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:16,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:16,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:16,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-02-02 09:25:16,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:25:16,706 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:25:16,714 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:16,730 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:25:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2018-02-02 09:25:16,753 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:25:16,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7
[2018-02-02 09:25:16,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-02 09:25:16,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-02 09:25:16,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2018-02-02 09:25:16,754 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 7 states.
[2018-02-02 09:25:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-02 09:25:16,795 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions.
[2018-02-02 09:25:16,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-02 09:25:16,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48
[2018-02-02 09:25:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-02 09:25:16,795 INFO L225 Difference]: With dead ends: 95
[2018-02-02 09:25:16,795 INFO L226 Difference]: Without dead ends: 95
[2018-02-02 09:25:16,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2018-02-02 09:25:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2018-02-02 09:25:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91.
[2018-02-02 09:25:16,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2018-02-02 09:25:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions.
[2018-02-02 09:25:16,797 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 48
[2018-02-02 09:25:16,798 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-02 09:25:16,798 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions.
[2018-02-02 09:25:16,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-02 09:25:16,798 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions.
[2018-02-02 09:25:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2018-02-02 09:25:16,798 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-02 09:25:16,798 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-02 09:25:16,798 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]===
[2018-02-02 09:25:16,798 INFO L82 PathProgramCache]: Analyzing trace with hash 255829617, now seen corresponding path program 1 times
[2018-02-02 09:25:16,798 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-02 09:25:16,798 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-02 09:25:16,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:16,799 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:16,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-02 09:25:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:16,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-02 09:25:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-02 09:25:17,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-02 09:25:17,572 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-02 09:25:17,577 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-02 09:25:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-02 09:25:17,598 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-02 09:25:17,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46
[2018-02-02 09:25:17,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2018-02-02 09:25:17,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:17,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:17,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46
[2018-02-02 09:25:17,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11
[2018-02-02 09:25:17,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:17,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:17,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:25:17,837 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:99, output treesize:117
[2018-02-02 09:25:17,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35
[2018-02-02 09:25:17,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:17,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35
[2018-02-02 09:25:17,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:17,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts.
[2018-02-02 09:25:17,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:89, output treesize:71
[2018-02-02 09:25:20,873 WARN L146 SmtUtils]: Spent 2846ms on a formula simplification. DAG size of input: 41 DAG size of output 23
[2018-02-02 09:25:27,027 WARN L146 SmtUtils]: Spent 4039ms on a formula simplification. DAG size of input: 68 DAG size of output 68
[2018-02-02 09:25:29,167 WARN L143 SmtUtils]: Spent 2021ms on a formula simplification that was a NOOP. DAG size: 66
[2018-02-02 09:25:29,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67
[2018-02-02 09:25:29,306 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:25:29,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33
[2018-02-02 09:25:29,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:29,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:29,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67
[2018-02-02 09:25:29,343 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:25:29,343 INFO L682 Elim1Store]: detected equality via solver
[2018-02-02 09:25:29,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55
[2018-02-02 09:25:29,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:29,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-02 09:25:29,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-02 09:25:29,375 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:151, output treesize:63
[2018-02-02 09:25:31,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-02 09:25:31,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-02 09:25:31,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35
[2018-02-02 09:25:31,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states
[2018-02-02 09:25:31,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2018-02-02 09:25:31,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1147, Unknown=25, NotChecked=0, Total=1260
[2018-02-02 09:25:31,651 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 36 states.
Received shutdown request...
[2018-02-02 09:25:40,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-02-02 09:25:40,828 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-02-02 09:25:40,831 WARN L185 ceAbstractionStarter]: Timeout
[2018-02-02 09:25:40,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:25:40 BoogieIcfgContainer
[2018-02-02 09:25:40,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-02 09:25:40,832 INFO L168 Benchmark]: Toolchain (without parser) took 74858.53 ms. Allocated memory was 399.5 MB in the beginning and 756.5 MB in the end (delta: 357.0 MB). Free memory was 356.4 MB in the beginning and 613.4 MB in the end (delta: -257.0 MB). Peak memory consumption was 100.0 MB. Max. memory is 5.3 GB.
[2018-02-02 09:25:40,832 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-02 09:25:40,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 139.69 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 343.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
[2018-02-02 09:25:40,833 INFO L168 Benchmark]: Boogie Preprocessor took 25.74 ms. Allocated memory is still 399.5 MB. Free memory was 343.2 MB in the beginning and 341.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-02 09:25:40,833 INFO L168 Benchmark]: RCFGBuilder took 163.34 ms. Allocated memory is still 399.5 MB. Free memory was 341.9 MB in the beginning and 323.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB.
[2018-02-02 09:25:40,833 INFO L168 Benchmark]: TraceAbstraction took 74526.94 ms. Allocated memory was 399.5 MB in the beginning and 756.5 MB in the end (delta: 357.0 MB). Free memory was 322.5 MB in the beginning and 613.4 MB in the end (delta: -290.9 MB). Peak memory consumption was 66.2 MB. Max. memory is 5.3 GB.
[2018-02-02 09:25:40,834 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.15 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 139.69 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 343.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 25.74 ms. Allocated memory is still 399.5 MB. Free memory was 343.2 MB in the beginning and 341.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 163.34 ms. Allocated memory is still 399.5 MB. Free memory was 341.9 MB in the beginning and 323.8 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 74526.94 ms. Allocated memory was 399.5 MB in the beginning and 756.5 MB in the end (delta: 357.0 MB). Free memory was 322.5 MB in the beginning and 613.4 MB in the end (delta: -290.9 MB). Peak memory consumption was 66.2 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 11 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 11 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 11 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 11 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 11 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 11 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 11 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 11 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (91states) and interpolant automaton (currently 11 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 74.4s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 54.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 834 SDtfs, 1219 SDslu, 3672 SDs, 0 SdLazy, 3441 SolverSat, 243 SolverUnsat, 42 SolverUnknown, 0 SolverNotchecked, 40.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 774 GetRequests, 466 SyntacticMatches, 20 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 27.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 222 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 1212 NumberOfCodeBlocks, 1212 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1179 ConstructedInterpolants, 102 QuantifiedInterpolants, 487659 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1865 ConjunctsInSsa, 255 ConjunctsInUnsatCore, 33 InterpolantComputations, 9 PerfectInterpolantSequences, 262/437 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-25-40-839.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-25-40-839.csv
Completed graceful shutdown